ON GRAPHS WITH LIMITED NUMBER OF P4-PARTNERS
From MaRDI portal
Publication:5248994
DOI10.1142/S0129054199000083zbMath1320.05129MaRDI QIDQ5248994
F. Roussel, Irena Rusu, Henri Thuillier
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Partitioning \(P_4\)-tidy graphs into a stable set and a forest ⋮ Clique-width of partner-limited graphs ⋮ The packing coloring problem for lobsters and partner limited graphs ⋮ Polynomial instances of the Packing Coloring Problem ⋮ Grundy dominating sequences on \(X\)-join product ⋮ On -sparse graphs and other families
Cites Work
- A semi-strong perfect graph theorem
- The splittance of a graph
- On a unique tree representation for \(P_ 4\)-extendible graphs
- \(P_{4}\)-laden graphs: A new class of brittle graphs
- On the structure of graphs with few \(P_4\)s
- Isomorphism of chordal (6, 3) graphs
- On the \(P_ 4\)-structure of perfect graphs. V: Overlap graphs
- On the sibling-structure of perfect graphs
- Some classes of perfectly orderable graphs
- Recognizing $P_4 $-Sparse Graphs in Linear Time
- Transitiv orientierbare Graphen