On the Point-Arboricity of a Graph and its Complement

DOI10.4153/CJM-1971-029-3MaRDI QIDQ5589871zbMATH OpenFDO

Authors John Mitchem

Publication date 1971

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

topology

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cited in

(7)

• Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
• List point arboricity of graphs
• Erdős-Hajnal well-orderings and n-degenerate graphs
• Graph theory
• Extremal decompositions for Nordhaus-Gaddum theorems
• Nordhaus–Gaddum problem in terms of G-free coloring
• Chromatic partitions of a graph

This page was built for publication: On the Point-Arboricity of a Graph and its Complement

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