On graphs with limited number of P₄-partners
From MaRDI portal
Publication:5248994
Recommendations
Cites work
- \(P_{4}\)-laden graphs: A new class of brittle graphs
- A semi-strong perfect graph theorem
- Isomorphism of chordal (6, 3) graphs
- On a unique tree representation for \(P_ 4\)-extendible graphs
- On the \(P_ 4\)-structure of perfect graphs. V: Overlap graphs
- On the sibling-structure of perfect graphs
- On the structure of graphs with few P₄s
- Recognizing P₄ -Sparse Graphs in Linear Time
- Some classes of perfectly orderable graphs
- The splittance of a graph
- Transitiv orientierbare Graphen
Cited in
(8)- Clique-width of partner-limited graphs
- Generalized limited packings of some graphs with a limited number of \(P_4\)-partners
- The packing coloring problem for lobsters and partner limited graphs
- Polynomial instances of the packing coloring problem
- On -sparse graphs and other families
- Efficient algorithms for graphs with few P₄'s
- Partitioning P₄-tidy graphs into a stable set and a forest
- Grundy dominating sequences on X-join product
This page was built for publication: On graphs with limited number of \(P_{4}\)-partners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248994)