scientific article; zbMATH DE number 3276423
From MaRDI portal
Publication:5560916
zbMath0173.26204MaRDI QIDQ5560916
Dennis P. Geller, Stephen T. Hedetniemi, Gary Chartrand
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
Dynamic \(F\)-free coloring of graphs ⋮ A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs ⋮ On the vertex arboricity of planar graphs of diameter two ⋮ Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs ⋮ The complexity of \(G\)-free colourability ⋮ Induced-path partition on graphs with special blocks ⋮ Colorings of plane graphs without long monochromatic facial paths ⋮ The path partition conjecture is true for claw-free graphs ⋮ Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable ⋮ WORM colorings of planar graphs ⋮ On monochromatic component size for improper colourings ⋮ Graph theory ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs ⋮ Generalizations of independence and chromatic numbers of a graph ⋮ The \(t\)-tone chromatic number of random graphs ⋮ Conditional chromatic numbers with forbidden cycles ⋮ Chromatic partitions of a graph ⋮ Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths ⋮ Graphs with forbidden subgraphs ⋮ The subchromatic number of a graph ⋮ A sequential coloring algorithm for finite sets ⋮ My Top 10 Graph Theory Conjectures and Open Problems
This page was built for publication:
