The following pages link to On rigid circuit graphs (Q773621):
Displayed 50 items.
- A note on lexicographic breadth first search for chordal graphs (Q673001) (← links)
- Which claw-free graphs are perfectly orderable? (Q686245) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- How is a chordal graph like a supersolvable binary matroid? (Q704292) (← links)
- Extending cycles in graphs (Q750461) (← links)
- Some aspects of perfect elimination orderings in chordal graphs (Q792351) (← links)
- On the representation of triangulation graphs in trees (Q794674) (← links)
- Weakly triangulated graphs (Q801088) (← links)
- Penta-extensions of hereditary classes of graphs (Q813334) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Partial inversion for linear systems and partial closure of independence graphs (Q855285) (← links)
- Simplicial nonpositive curvature (Q859793) (← links)
- On the Hadwiger's conjecture for graph products (Q864168) (← links)
- Improving on the maximum likelihood estimators of the means in Poisson decomposable graphical models (Q864277) (← links)
- Centers of triangulated graphs (Q912134) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Local topology of the free complex of a two-dimensional generalized convex shelling (Q932635) (← links)
- Chordal Coxeter groups. (Q960043) (← links)
- On split-coloring problems (Q995923) (← links)
- On compact and efficient routing in certain graph classes (Q997073) (← links)
- Cohen-Macaulay monomial ideals of codimension 2 (Q1003145) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- The competition number of a graph with exactly \(h\) holes, all of which are independent (Q1028099) (← links)
- On 2-walks in chordal planar graphs (Q1043570) (← links)
- Estimating high-dimensional intervention effects from observational data (Q1043733) (← links)
- Characterizations of strongly chordal graphs (Q1051004) (← links)
- A characterization of graphs of competition number m (Q1055444) (← links)
- On powers and centers of chordal graphs (Q1055453) (← links)
- No graph has a maximal 3-ring of bonds (Q1059647) (← links)
- Counting labelled chordal graphs (Q1062069) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- Graph minors. V. Excluding a planar graph (Q1079583) (← links)
- On local convexity in graphs (Q1089354) (← links)
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (Q1095923) (← links)
- On the null-homotopy of bridged graphs (Q1099187) (← links)
- Locally perfect graphs (Q1105623) (← links)
- Bridged graphs and geodesic convexity (Q1106237) (← links)
- Chordal graph recognition is in NC (Q1108003) (← links)
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390) (← links)
- Maximal chordal subgraphs (Q1115455) (← links)
- Weak bipolarizable graphs (Q1116961) (← links)
- On diameters and radii of bridged graphs (Q1117245) (← links)
- Simplicial decompositions of graphs: A survey of applications (Q1118617) (← links)
- Recognizing claw-free perfect graphs (Q1118619) (← links)
- A note on perfect orders (Q1124614) (← links)
- Inheritance principles for chordal graphs (Q1173947) (← links)