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

DOI10.1007/BF02941418MaRDI QIDQ1143403zbMATH OpenFDO

Authors 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)

Full work available at URL https://doi.org/10.1007/BF02941418

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

• k-Degenerate Graphs
• A note on graphs with prescribed clique and point-partition numbers
• Critical Point-Arboritic Graphs
• scientific article; zbMATH DE number 3477220 (Why is no real title available?)
• scientific article; zbMATH DE number 3482395 (Why is no real title available?)
• scientific article; zbMATH DE number 3513827 (Why is no real title available?)
• scientific article; zbMATH DE number 3517211 (Why is no real title available?)
• scientific article; zbMATH DE number 3542457 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3339167 (Why is no real title available?)
• Joins of n-degenerate graphs and uniquely (m,n)-partitionable graphs
• On chromatic number of graphs and set-systems
• On Graphs with Prescribed Clique Number and Point-Arboricity
• On the Point-Arboricity of a Graph and its Complement
• The Point Partition Numbers of Closed 2-Manifolds
• Uniquely k-arborable graphs
• Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1143403)