The following pages link to On rigid circuit graphs (Q773621):
Displaying 50 items.
- Probabilistic pursuits on graphs (Q2330128) (← links)
- Generalized chordality, vertex separators and hyperbolicity on graphs (Q2333406) (← links)
- A de Bruijn-Erdős theorem for chordal graphs (Q2341062) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- Supersolvability and freeness for \(\psi\)-graphical arrangements (Q2351029) (← links)
- Simplicial orders and chordality (Q2358798) (← links)
- A note on independence complexes of chordal graphs and dismantling (Q2363095) (← links)
- Optimal decomposition by clique separators (Q2366013) (← links)
- An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437) (← links)
- The story of perfectly orderable graphs (Q2373439) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- Drawings of planar graphs with few slopes and segments (Q2385699) (← links)
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs (Q2403803) (← links)
- The Hadwiger number, chordal graphs and \(ab\)-perfection (Q2409752) (← links)
- Toric chordality (Q2409930) (← links)
- On the phylogeny graphs of degree-bounded digraphs (Q2410253) (← links)
- Forbidden induced subgraphs (Q2413330) (← links)
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs (Q2413965) (← links)
- Solving the clique cover problem on (bull, \(C_4\))-free graphs (Q2414459) (← links)
- Decomposable clutters and a generalization of Simon's conjecture (Q2419475) (← links)
- On coherence of graph products of groups and Coxeter groups (Q2421876) (← links)
- A note on the edge cover number and independence number in hypergraphs (Q2427533) (← links)
- Erdős-Ko-Rado theorems for chordal graphs and trees (Q2431248) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (Q2436666) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- Moplex orderings generated by the LexDFs algorithm (Q2446863) (← links)
- Subset feedback vertex sets in chordal graphs (Q2447531) (← links)
- On the correspondence between tree representations of chordal and dually chordal graphs (Q2448885) (← links)
- Searching for better fill-in (Q2453556) (← links)
- Linear resolutions of quadratic monomial ideals (Q2470382) (← links)
- On guarding the vertices of rectilinear domains (Q2477198) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers (Q2481678) (← links)
- Skew partitions in perfect graphs (Q2482110) (← links)
- Formulas for counting acyclic digraph Markov equivalence classes (Q2491863) (← links)
- Cohen--Macaulay chordal graphs (Q2497976) (← links)
- Representation characterizations of chordal bipartite graphs (Q2498738) (← links)
- On axioms constituting the foundation of hypergraph theory (Q2508044) (← links)
- Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
- Junction trees of general graphs (Q2519354) (← links)
- Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs (Q2520720) (← links)
- Triangulated graphs and the elimination process (Q2545884) (← links)
- Anti-blocking polyhedra (Q2549326) (← links)
- The intersection graphs of subtrees in trees are exactly the chordal graphs (Q2562090) (← links)
- Oracles for vertex elimination orderings (Q2566003) (← links)
- A generalization of the theorem of Lekkerkerker and Boland (Q2568478) (← links)
- The competition number of a graph having exactly one hole (Q2576849) (← links)
- Dot product dimensions of graphs (Q2636805) (← links)
