On rigid circuit graphs

1961/04/01 by G. A. Dirac · 953 citations
Computer Science · Engineering · Mathematics · #Computer science #Manufacturing Process and Optimization #Mathematics #Model-Driven Software Engineering Techniques #Structural Analysis and Optimization

paper · doi:10.1007/bf02992776

published in Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 25(1-2), 71-76 (Springer Science+Business Media)

crossref issued 1961/04/01 · crossref published 1961/04/01 · crossref published-print 1961/04/01 · openalex publication_date 1961/04/01 · crossref created 2008/11/26 · crossref deposited 2019/05/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23 · crossref indexed 2026/08/04

Citations

• A Colour Problem for Infinite Graphs and a Problem in the Theory of Relations

Cited by

• A characterization of partial 3‐trees
• Approximating treewidth and pathwidth of some classes of perfect graphs
• Computing treewidth and minimum fill-in: All you need are the minimal separators
• Subexponential Parameterized Algorithm for Minimum Fill-In
• Linearly χ‐bounding (P6, C4)‐free graphs*
• Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
• A characterization of ptolemaic graphs
• Edge Dominating Sets in Graphs
• A Recursive Characterization of Laplacian Spectral Radii of Trees with Bounded Maximum Degree
• The LBFS Structure and Recognition of Interval Graphs
• Homological shift ideals
• Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations
• Convexity in Graphs and Hypergraphs
• Estimating high-dimensional intervention effects from observational data
• Characterizations and algorithmic applications of chordal graph embeddings
• A Localization Approach to Improve Iterative Proportional Scaling in Gaussian Graphical Models
• On the Stanley depth of squarefree monomial ideals
• Simon conjecture and the v -number of monomial ideals
• Monadic second-order logic and hypergraph orientation
• A separation property of planar triangulations
• Partial search orderings for MCS on chordal graphs via clique graph decomposition
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Dually Chordal Graphs
• Register Allocation Via Coloring of Chordal Graphs
• Chordal graph [wikipedia]