The following pages link to On rigid circuit graphs (Q773621):
Displaying 50 items.
- Cohen-Macaulay admissible clutters (Q847969) (← 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)
- Homotopy equivalence in finite digital images (Q892819) (← links)
- The firefighter problem on graph classes (Q899308) (← links)
- Critical exponents of graphs (Q899490) (← links)
- Bounds on the Stanley depth and Stanley regularity of edge ideals of clutters (Q901030) (← links)
- Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph (Q907257) (← links)
- Combinatorial topology and the global dimension of algebras arising in combinatorics (Q907273) (← 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)
- Betti numbers of chordal graphs and \(f\)-vectors of simplicial complexes (Q961022) (← links)
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- On right-angled Artin groups without surface subgroups. (Q965090) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- Independence complexes of chordal graphs (Q982628) (← 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)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← 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)
