On Partitioning Planar Graphs
From MaRDI portal
Publication:5554152
DOI10.4153/CMB-1968-023-5zbMath0167.21805MaRDI QIDQ5554152
Publication date: 1968
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Related Items (16)
Point partition numbers: decomposable and indecomposable critical graphs ⋮ A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs ⋮ Generalized perfect graphs: Characterizations and inversion ⋮ The existence of uniquely \(-G\) colourable graphs ⋮ The complexity of generalized graph colorings ⋮ A Canonical Ramsey Theorem ⋮ Generalized DP-colorings of graphs ⋮ ON UNIQUELY -G k-COLOURABLE GRAPHS ⋮ Graph properties and hypergraph colourings ⋮ Acyclic colorings of planar graphs ⋮ On acyclic colorings of planar graphs. (Reprint) ⋮ The biparticity of a graph ⋮ On acyclic colorings of planar graphs ⋮ Conditional chromatic numbers with forbidden cycles ⋮ The subchromatic number of a graph ⋮ Point partition numbers: perfect graphs
This page was built for publication: On Partitioning Planar Graphs
