Absolute retracts of split graphs

DOI10.1016/0012-365X(93)E0062-9zbMath0812.05051OpenAlexW2113859425MaRDI QIDQ1339865

Sandi Klavžar

Publication date: 9 May 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0062-9

zbMATH Keywords

partitionstable setcolouringsplit graphsretractabsolute retractcomplete split graphcomplete setforbidden retractsreflexive split graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Beyond Helly graphs: the diameter problem on absolute retracts ⋮ Endomorphism-regularity of split graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clique graphs and Helly graphs
• A characterization of absolute retracts of n-chromatic graphs
• Dismantling absolute retracts of reflexive graphs
• Absolute retracts of bipartite graphs
• Vertex-to-vertex pursuit in a graph
• The smallest graph variety containing all paths
• Absolute planar retracts and the four colour conjecture
• Absolute Retracts and Varieties of Reflexive Graphs
• A Classification of Reflexive Graphs: The use of “Holes”
• Minimal extensions of graphs to absolute retracts
• Products of absolute retracts

This page was built for publication: Absolute retracts of split graphs