G. A. Dirac, On Rigid Circuit Graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961), 71--76. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
A Note on R-Dominating Cliques - Chepoi (Correct)
Distance Approximating Trees for Chordal and Dually.. - Brandstädt, Chepoi.. (1997) (5 citations) (Correct)
Representing a Concept Lattice By a Graph - Berry, Sigayret (2002) (Correct)
The Minimum Degree Heuristic and the Minimal - Berry, Heggernes, Simonet (Correct)
A Wide-Range Algorithm for Minimal Triangulation.. - Berry, Bordat.. (2003) (Correct)
Representing a Concept Lattice By a Graph - Berry, Sigayret (2002) (Correct)
Approximations for lambda-Coloring of Graphs - Bodlaender, Kloks, Tan, van.. (2000) (Correct)
Treewidth: Computational Experiments - Koster, Bodlaender, van Hoesel (2001) (4 citations) (Correct)
Tree Decomposition With Small Cost - Bodlaender, Fomin (2002) (2 citations) (Correct)
Efficient Parallel Algorithms for Chordal Graphs - Klein (1988) (23 citations) (Correct)
Finding Good Column Orderings for Sparse QR Factorization - Heggernes, Matstoms (1996) (3 citations) (Correct)
Packing Cuts in Undirected Graphs - Caprara, Panconesi, Rizzi (1999) (Correct)
Fast Generation of All Perfect Elimination Orderings .. - Chandran, Ibarra.. (2002) (Correct)
Treewidth: Computational Experiments - Koster, Bodlaender, van Hoesel (2001) (4 citations) (Correct)
Uncolorable Mixed Hypergraphs - Tuza, Voloshin (1997) (1 citation) (Correct)
Recognizing Weakly Triangulated Graphs by Edge Separability - Berry, Bordat, al. (2000) (6 citations) (Correct)
Asteroidal Triples of Moplexes - Berry, Bordat (2000) (Correct)
Local LexBFS Properties in an Arbitrary Graph - Berry, Bordat (2000) (Correct)
Triangulated and Weakly Triangulated Graphs: Simpliciality in.. - Berry, Bordat (2001) (1 citation) (Correct)
Pushing Vertices in Digraphs Without Long Induced Cycles - Huang, MacGillivray, Yeo (Correct)
Conditions for Beta-Perfectness - Keijsper, Tewes (2000) (Correct)
DOI: 10.1007/s00453-001-0109-4 - Algorithmica Algorithmica.. (Correct)
EfficientParallel Graph Algorithms For Coarse - Grained Multicomputers And (Correct)
Nonlinear Approximation - Eisenbud Green Hulek (Correct)
Vertex Rankings of Chordal Graphs and Weighted Trees - Dereniowski, Nadolski (2006) (Correct)
Certifying Algorithms for Recognizing Interval Graphs and.. - Graphs Dieter Kratsch (Correct)
Efficient Parallel Graph Algorithms for Coarse-Grained .. - Dehne, Ferreira.. (2002) (18 citations) (Correct)
Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (18 citations) (Correct)
Two Tricks to Triangulate Chordal Probe Graphs in.. - Berry, Golumbic, Lipshteyn (2004) (Correct)
Efficient Parallel Graph Algorithms for Coarse-Grained.. - Dehne, Ferreira, E. (2002) (18 citations) (Correct)
Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (18 citations) (Correct)
On Stable Cutsets in Graphs - Brandstädt, Dragan, Le, Szymczak (2000) (8 citations) (Correct)
Clique r-Domination and Clique r-Packing Problems on.. - Brandstädt, Chepoi.. (1997) (Correct)
Dually Chordal Graphs - Brandstädt, Dragan, Chepoi, Voloshin (1998) (Correct)
Convexity and HHD-Free Graphs - Dragan, Nicolai, Brandstädt (1999) (Correct)
Really Straight Graph Drawings - Dujmovic, Suderman, Wood (2004) (Correct)
An on-Line Incremental Approach for Dynamically.. - Berry, Heggernes.. (2003) (Correct)
Graph Extremities and Minimal Separation - Berry (2003) (Correct)
Characterisations of Intersection Graphs by Vertex Orderings - Wood (2004) (Correct)
Recognizing and Triangulating Chordal Probe Graphs - Berry, Golumbic, Lipshteyn (2003) (Correct)
Vertex Colouring and Forbidden Subgraphs - a Survey - Randerath, Schiermeyer (2003) (Correct)
Efficient Parallel Graph Algorithms for.. - Dehne, Ferreira.. (2002) (18 citations) (Correct)
Generating and Characterizing the Perfect.. - Chandran, Ibarra.. (2003) (Correct)
Representing a Concept Lattice By a Graph - Berry, Sigayret (2004) (Correct)
Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (18 citations) (Correct)
Weaving through a Crowd of Minimal Separators - Berry (2003) (Correct)
How Is a Chordal Graph Like a Supersolvable Binary Matroid? - Cordovil, Forge, Klein (Correct)
On 3-Simplicial Vertices in Planar Graphs - Boros, Jamison, al. (2001) (Correct)
Efficient Parallel Graph Algorithms for.. - Dehne, Ferreira.. (1997) (18 citations) (Correct)
Separability generalizes Dirac's theorem - Berry, Bordat (1998) (1 citation) Self-citation (Dirac) (Correct)
First 50 documents Next 50
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