The following pages link to (Q3271426):
Displaying 50 items.
- Graphs of edge-intersecting and non-splitting paths (Q288788) (← links)
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- Helly theorems for 3-Steiner and 3-monophonic convexity in graphs (Q534056) (← links)
- A Ramsey-type theorem and its application to relatives of Helly's theorem (Q759161) (← links)
- On rigid circuit graphs (Q773621) (← links)
- Weakly triangulated graphs (Q801088) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- Some remarks on interval graphs (Q1050372) (← links)
- New classes of perfect graphs (Q1087552) (← links)
- A semi-strong perfect graph theorem (Q1104341) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
- Zur Theorie der perfekten Graphen (Q1134773) (← links)
- Centers of chordal graphs (Q1180670) (← links)
- On packing and covering numbers of graphs (Q1185083) (← links)
- On slim graphs, even pairs, and star-cutsets (Q1199476) (← links)
- Studies on hypergraphs. I: Hyperforests (Q1209154) (← links)
- Matroidal graphs (Q1244250) (← links)
- Infinite triangulated graphs (Q1247986) (← links)
- Induced matchings (Q1262877) (← links)
- Pseudo-chordal mixed hypergraphs (Q1301719) (← links)
- Motivations and history of some of my conjectures (Q1356729) (← links)
- Universally signable graphs (Q1375057) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Piercing axis-parallel boxes (Q1753044) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- Transversals of 2-intervals, a topological approach (Q1842574) (← links)
- A characterisation of rigid circuit graphs (Q1846437) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- On point covers of multiple intervals and axis-parallel rectangles (Q1924491) (← links)
- On strictly chordality-\(k\) graphs (Q2181248) (← links)
- On the interval chromatic number of proper interval graphs (Q2352054) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- The Hadwiger number, chordal graphs and \(ab\)-perfection (Q2409752) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Representation characterizations of chordal bipartite graphs (Q2498738) (← links)
- Computing partial hypergraphs of bounded width (Q2686128) (← links)
- Characterizing directed path graphs by forbidden asteroids (Q3174239) (← links)
- Covering, Packing and Generalized Perfection (Q3220635) (← links)
- A Separator Theorem for Chordal Graphs (Q3344230) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
- Characterizing path graphs by forbidden induced subgraphs (Q3652563) (← links)
- The Comparability Graph of a Tree (Q3845886) (← links)
- On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
- Linear-Time Generation of Random Chordal Graphs (Q5283388) (← links)
- Disjointness graphs of segments in the space (Q5886095) (← links)
