A New Class of Brittle Graphs
From MaRDI portal
Recommendations
- On brittle graphs
- Quasi-brittle graphs, a new class of perfectly orderable graphs
- A NEW CHARACTERIZATION OF UNBREAKABLE GRAPHS
- \(P_{4}\)-laden graphs: A new class of brittle graphs
- Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
- On the structure of unbreakable graphs
- A note on fragile graphs
- Graphs of bounded depth‐2 rank‐brittleness
- On the broken-circuit complex of graphs
- On the toughness of graphs
Cites work
Cited in
(33)- Laplacian integrality in \(P_4\)-sparse and \(P_4\)-extendible graphs
- A note on fragile graphs
- The clique operator on graphs with few \(P_{4}\)'s
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Hitting subgraphs in \(P_4\)-tidy graphs
- Recognizing well covered graphs of families with special \(P _{4}\)-components
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
- Finding houses and holes in graphs
- Isomorphism of chordal (6, 3) graphs
- On graphs with a single large Laplacian eigenvalue
- Quasi-brittle graphs, a new class of perfectly orderable graphs
- Minimal separators in extended \(P_4\)-laden graphs
- Partitioning P₄-tidy graphs into a stable set and a forest
- \(b\)-coloring of tight graphs
- Total dominating sequences in trees, split graphs, and under modular decomposition
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs
- Partial characterizations of circle graphs
- Grundy double domination number: bounds, graph operations, and efficient computation for P₄-tidy graphs
- Classes of perfect graphs
- Probe interval and probe unit interval graphs on superclasses of cographs
- On brittle graphs
- \(P_{4}\)-laden graphs: A new class of brittle graphs
- Restricted coloring problems on graphs with few P₄'s
- On some special classes of contact \(B_0\)-VPG graphs
- On the structure of graphs with few P₄s
- A fast parallel algorithm to recognize partitionable graphs
- Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
- A simple linear time algorithm for cograph recognition
- The multiple domination and limited packing problems in graphs
- On the \(P_4\)-components of graphs
- Counting spanning trees using modular decomposition
- Clique-perfectness and balancedness of some graph classes
- On the isomorphism of graphs with few P4s
This page was built for publication: A New Class of Brittle Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3478443)
