On Partitioning Planar Graphs

DOI10.4153/CMB-1968-023-5MaRDI QIDQ5554152zbMATH OpenFDO

Authors Stephen T. Hedetniemi

Publication date 1968

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CMB-1968-023-5

zbMATH Keywords

topology

Cited in

(16)

• Graph properties and hypergraph colourings
• On acyclic colorings of planar graphs
• The existence of uniquely \(-G\) colourable graphs
• Conditional chromatic numbers with forbidden cycles
• The subchromatic number of a graph
• Generalized perfect graphs: Characterizations and inversion
• The complexity of generalized graph colorings
• Point partition numbers: perfect graphs
• Point partition numbers: decomposable and indecomposable critical graphs
• A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
• On acyclic colorings of planar graphs. (Reprint)
• A Canonical Ramsey Theorem
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• The biparticity of a graph
• Acyclic colorings of planar graphs
• Generalized DP-colorings of graphs

This page was built for publication: On Partitioning Planar Graphs

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