scientific article
From MaRDI portal
Publication:3688407
zbMath0571.05017MaRDI QIDQ3688407
Izak Broere, Christina M. Mynhardt
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (22)
Path choosability of planar graphs ⋮ Induced-path partition on graphs with special blocks ⋮ On the minimal reducible bound for outerplanar and planar graphs ⋮ On path-chromatically unique graphs ⋮ The existence of uniquely \(-G\) colourable graphs ⋮ The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing ⋮ The complexity of generalized graph colorings ⋮ Partitions of graphs into cographs ⋮ ON UNIQUELY -G k-COLOURABLE GRAPHS ⋮ Drawing Graphs on Few Lines and Few Planes ⋮ Subcolorings and the subchromatic number of a graph ⋮ Acyclic colorings of planar graphs ⋮ On monochromatic component size for improper colourings ⋮ Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments ⋮ Minimum \(k\)-path vertex cover ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs ⋮ Generalizations of independence and chromatic numbers of a graph ⋮ Conditional chromatic numbers with forbidden cycles ⋮ The subchromatic number of a graph ⋮ Unnamed Item ⋮ Generalized partitions of graphs ⋮ On uniquely partitionable planar graphs
This page was built for publication:
