G. A. Dirac, On Rigid Circuit Graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961), 71--76. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
DOI: 10.1007/s00453-001-0109-4 - Algorithmica Algorithmica.. (Correct)
No context found.
G. A. Dirac, On Rigid Circuit Graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961), 71--76.
EfficientParallel Graph Algorithms For Coarse - Grained Multicomputers And (Correct)
No context found.
G.A. Dirac. "On rigid circuit graphs". Abh. Math. Sem. Univ. Hamburg 25, 1961, pp. 71--76.
Nonlinear Approximation - Eisenbud Green Hulek (Correct)
No context found.
G. A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25 (1--2) (1961), 71--76.
Vertex Rankings of Chordal Graphs and Weighted Trees - Dereniowski, Nadolski (2006) (Correct)
No context found.
G.A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25 (1961) 71-76.
Certifying Algorithms for Recognizing Interval Graphs and.. - Graphs Dieter Kratsch (Correct)
No context found.
G. A Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961) pp. 71--76.
Efficient Parallel Graph Algorithms for Coarse-Grained .. - Dehne, Ferreira.. (2002) (18 citations) (Correct)
No context found.
G. A. Dirac, On Rigid Circuit Graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961), 71--76.
Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (18 citations) (Correct)
No context found.
G.A. Dirac. "On rigid circuit graphs". Abh. Math. Sem. Univ. Hamburg 25, 1961, pp. 71--76.
Two Tricks to Triangulate Chordal Probe Graphs in.. - Berry, Golumbic, Lipshteyn (2004) (Correct)
No context found.
G.A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25:71-76, 1961.
Efficient Parallel Graph Algorithms for Coarse-Grained.. - Dehne, Ferreira, E. (2002) (18 citations) (Correct)
No context found.
G. A. Dirac, On Rigid Circuit Graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961), 71--76.
Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (18 citations) (Correct)
No context found.
G.A. Dirac. "On rigid circuit graphs". Abh. Math. Sem. Univ. Hamburg 25, 1961, pp. 71--76.
On Stable Cutsets in Graphs - Brandstädt, Dragan, Le, Szymczak (2000) (8 citations) (Correct)
No context found.
G. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25 (1961) 71--76.
Clique r-Domination and Clique r-Packing Problems on.. - Brandstädt, Chepoi.. (1997) (Correct)
No context found.
G. A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961), pp. 71--76.
Dually Chordal Graphs - Brandstädt, Dragan, Chepoi, Voloshin (1998) (Correct)
No context found.
G. A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961), pp. 71--76.
Convexity and HHD-Free Graphs - Dragan, Nicolai, Brandstädt (1999) (Correct)
No context found.
G.A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961), pp. 71--76.
Really Straight Graph Drawings - Dujmovic, Suderman, Wood (2004) (Correct)
No context found.
G. A. Dirac, On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25:71--76, 1961.
An on-Line Incremental Approach for Dynamically.. - Berry, Heggernes.. (2003) (Correct)
No context found.
G. A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25:71-76, 1961.
Graph Extremities and Minimal Separation - Berry (2003) (Correct)
No context found.
G.A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25:71-76, 1961.
Characterisations of Intersection Graphs by Vertex Orderings - Wood (2004) (Correct)
No context found.
G. A. Dirac, On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25:71--76, 1961.
Recognizing and Triangulating Chordal Probe Graphs - Berry, Golumbic, Lipshteyn (2003) (Correct)
No context found.
G.A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25:71-76, 1961.
Vertex Colouring and Forbidden Subgraphs - a Survey - Randerath, Schiermeyer (2003) (Correct)
No context found.
G. A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25 (1961), 71-76.
Efficient Parallel Graph Algorithms for.. - Dehne, Ferreira.. (2002) (18 citations) (Correct)
No context found.
G. A. Dirac, On Rigid Circuit Graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961), 71--76.
Generating and Characterizing the Perfect.. - Chandran, Ibarra.. (2003) (Correct)
No context found.
G.A. Dirac, On rigidcircuit graphs, Abh. Math. Sem. Univ. Hamburg 24 (1961) 71--76.
Representing a Concept Lattice By a Graph - Berry, Sigayret (2004) (Correct)
No context found.
G.A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg 25 (1961) 7176.
Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (18 citations) (Correct)
No context found.
G.A. Dirac. "On rigid circuit graphs". Abh. Math. Sem. Univ. Hamburg 25, 1961, pp. 71--76.
Weaving through a Crowd of Minimal Separators - Berry (2003) (Correct)
No context found.
G. A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25:71-76, 1961.
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