The following pages link to A New Class of Brittle Graphs (Q3478443):
Displaying 13 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)
- Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038) (← links)
