The following pages link to On rigid circuit graphs (Q773621):
Displaying 50 items.
- The dense amalgam of metric compacta and topological characterization of boundaries of free products of groups (Q260123) (← links)
- Castelnuovo-Mumford regularity under reduction processes on graphs and hypergraphs (Q277508) (← links)
- Induced cycles in triangle graphs (Q298987) (← links)
- On basic chordal graphs and some of its subclasses (Q299101) (← links)
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- Max point-tolerance graphs (Q344833) (← links)
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs (Q372841) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- A Dirac-type characterization of \(k\)-chordal graphs (Q394280) (← links)
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- The competition number of a graph with exactly two holes (Q434196) (← links)
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287) (← links)
- Characterizing and computing the structure of clique intersections in strongly chordal graphs (Q479046) (← links)
- New results on Ptolemaic graphs (Q499349) (← links)
- Stability of Betti numbers under reduction processes: towards chordality of clutters (Q507799) (← links)
- More bounds for the Grundy number of graphs (Q511707) (← links)
- Learning discrete decomposable graphical models via constraint optimization (Q517387) (← links)
- Helly theorems for 3-Steiner and 3-monophonic convexity in graphs (Q534056) (← links)
- Regularity of edge ideals of \(C_{4}\)-free graphs via the topology of the lcm-lattice (Q618304) (← links)
- Minimal free resolutions of linear edge ideals (Q627986) (← links)
- On the discovery of the cycle-axiom of hypergraphs (Q628625) (← links)
- On the Colin de Verdière number of graphs (Q630509) (← links)
- Probability distributions with summary graph structure (Q638759) (← links)
- Crown-free lattices and their related graphs (Q651416) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Some properties of edge intersection graphs of single-bend paths on a grid (Q658070) (← links)
- All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected (Q659731) (← links)
- Dirac's theorem on simplicial matroids (Q659777) (← links)
- Shellable quasi-forests and their \(h\)-triangles (Q663317) (← links)
- A note on lexicographic breadth first search for chordal graphs (Q673001) (← links)
- Complexity of simplicial homology and independence complexes of chordal graphs (Q679745) (← 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)
- Enumerating minimal dominating sets in chordal graphs (Q738877) (← links)
- Special eccentric vertices for the class of chordal graphs and related classes (Q742574) (← links)
- Extending cycles in graphs (Q750461) (← links)
- Licci binomial edge ideals (Q778714) (← links)
- Totally balanced dissimilarities (Q779024) (← 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)
- Vertex rankings of chordal graphs and weighted trees (Q844166) (← links)