A note on graphs with prescribed clique and point-partition numbers

DOI10.1016/0095-8956(73)90008-7zbMath0242.05127OpenAlexW2061310628MaRDI QIDQ2553978

J. M. S. Simões-Pereira

Publication date: 1973

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(73)90008-7

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Erdős-Hajnal well-orderings and n-degenerate graphs ⋮ Joins of n-degenerate graphs and uniquely (m,n)-partitionable graphs ⋮ An extension of Brooks' theorem to n-degenerate graphs

Cites Work

• Unnamed Item
• Graphs with forbidden subgraphs
• k-Degenerate Graphs
• On Graphs with Prescribed Clique Number and Point-Arboricity

This page was built for publication: A note on graphs with prescribed clique and point-partition numbers