Erdős-Hajnal well-orderings and n-degenerate graphs

DOI10.1007/BF02941418zbMath0442.05026MaRDI QIDQ1143403

J. M. S. Simões-Pereira

Publication date: 1980

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

zbMATH Keywords

Erdős-Hajnal sequencesmaximal partitionability of a graphn-degenerate graphunique partitionability of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Joins of n-degenerate graphs and uniquely (m,n)-partitionable graphs
• Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
• Uniquely k-arborable graphs
• A note on graphs with prescribed clique and point-partition numbers
• Critical Point-Arboritic Graphs
• On chromatic number of graphs and set-systems
• On the Point-Arboricity of a Graph and its Complement
• k-Degenerate Graphs
• On Graphs with Prescribed Clique Number and Point-Arboricity
• The Point Partition Numbers of Closed 2-Manifolds

This page was built for publication: Erdős-Hajnal well-orderings and n-degenerate graphs