The following pages link to A New Class of Brittle Graphs (Q3478443):
Displaying 28 items.
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs (Q617902) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- A fast parallel algorithm to recognize partitionable graphs (Q917295) (← links)
- \(P_{4}\)-laden graphs: A new class of brittle graphs (Q1349998) (← links)
- On the structure of graphs with few \(P_4\)s (Q1392556) (← links)
- Total dominating sequences in trees, split graphs, and under modular decomposition (Q1662158) (← links)
- \(b\)-coloring of tight graphs (Q1759847) (← links)
- Minimal separators in extended \(P_4\)-laden graphs (Q1759855) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- Isomorphism of chordal (6, 3) graphs (Q1893148) (← links)
- The multiple domination and limited packing problems in graphs (Q1944215) (← links)
- On the \(P_4\)-components of graphs (Q1971221) (← links)
- Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
- On some special classes of contact \(B_0\)-VPG graphs (Q2064288) (← links)
- Laplacian integrality in \(P_4\)-sparse and \(P_4\)-extendible graphs (Q2323491) (← links)
- Quasi-brittle graphs, a new class of perfectly orderable graphs (Q2366016) (← links)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
- On graphs with a single large Laplacian eigenvalue (Q2413188) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Counting spanning trees using modular decomposition (Q2437761) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- The clique operator on graphs with few \(P_{4}\)'s (Q2489945) (← links)
- Probe interval and probe unit interval graphs on superclasses of cographs (Q2840732) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
- Finding houses and holes in graphs (Q5941278) (← links)
- Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038) (← links)
