J. Walter. Representations of rigid cycle graphs. PhD thesis, Wayne State University, USA, 1972. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Algorithms for Square Roots of Graphs - Lin, Skiena (1991) (12 citations) (Correct)
....rigidcircuit, monotone transitive, and perfect elimination graphs [6, 19, 9, 22] Rose, Tarjan, and Lueker [22] presented an algorithm for recognition of chordal graph in linear time. Along with their algorithm, the maximum clique of a chordal graph can also be found in linear time. Walter [28], Gavril [11] and Buneman [4] proved that a graph G is chordal if and only if G is the intersection graph of a family of subtrees of a tree. Observe that the square of a chordal graph is not necessarily chordal, as shown in Figure 10. However, we will show that any arbitrary powers of trees are ....
J.R. Walter. Representations of rigid cycle graphs. PhD thesis, Wayne State Univ., 1972.
An on-Line Incremental Approach for Dynamically.. - Berry, Heggernes.. (2003) (Correct)
No context found.
J. Walter. Representations of rigid cycle graphs. PhD thesis, Wayne State University, USA, 1972.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC