The following pages link to On rigid circuit graphs (Q773621):
Displaying 50 items.
- Separability generalizes Dirac's theorem (Q1392561) (← links)
- 2-role assignments on triangulated graphs. (Q1401397) (← links)
- On simplicial and co-simplicial vertices in graphs. (Q1428559) (← links)
- Surface subgroups of Coxeter and Artin groups. (Q1434769) (← links)
- A class of \(\beta\)-perfect graphs (Q1567275) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- All wheels with two missing consecutive spokes are chromatically unique (Q1584221) (← links)
- Pushing vertices in digraphs without long induced cycles (Q1613399) (← links)
- Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\) (Q1618244) (← links)
- Mock threshold graphs (Q1637131) (← links)
- Graph extremities defined by search algorithms (Q1662546) (← links)
- An introduction to clique minimal separator decomposition (Q1662549) (← links)
- Computing a clique tree with the algorithm maximal label search (Q1662609) (← links)
- Inequalities for free multi-braid arrangements (Q1669188) (← links)
- Retracts and algebraic properties of cut algebras (Q1686265) (← links)
- Some problems on induced subgraphs (Q1693168) (← links)
- A note on chromatic number of (cap, even hole)-free graphs (Q1712540) (← links)
- The type defect of a simplicial complex (Q1713506) (← links)
- Vertex-weighted graphs and freeness of $ \psi $-graphical arrangements (Q1739204) (← links)
- Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983) (← links)
- Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
- On the contour of bipartite graphs (Q1752491) (← links)
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs (Q1752498) (← links)
- Clique trees of infinite locally finite chordal graphs (Q1753106) (← links)
- On minimal vertex separators of dually chordal graphs: properties and characterizations (Q1759837) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- Tree decompositions with small cost (Q1764801) (← links)
- Strong branchwidth and local transversals (Q1764812) (← links)
- Constant tolerance intersection graphs of subtrees of a tree (Q1764901) (← links)
- What is reconstruction for ordered sets? (Q1772277) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- Koszul binomial edge ideals of pairs of graphs (Q1794075) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- \(p\)-competition graphs (Q1805319) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- On the semi-perfect elimination (Q1825204) (← links)
- Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality (Q1836675) (← links)
- The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
- A characterisation of rigid circuit graphs (Q1846437) (← links)
- Toughness and Hamiltonicity of a class of planar graphs (Q1883251) (← links)
- Dirac's theorem on chordal graphs and Alexander duality (Q1883607) (← links)
- Generating and characterizing the perfect elimination orderings of a chordal graph (Q1885018) (← links)
- Representing a concept lattice by a graph (Q1885806) (← links)
- Recognizing bull-free perfect graphs (Q1895822) (← links)
- A note on perfectly orderable graphs (Q1917281) (← links)
- On the chromatic uniqueness of the graph \(W(n,n-2,k)\) (Q1923777) (← links)
- Finding a sun in building-free graphs (Q1926049) (← links)
- Chordal digraphs (Q1929220) (← links)
- Sequences of regressions and their independences (Q1936537) (← links)
- The regularity of edge ideals of graphs (Q1940204) (← links)
