scientific article; zbMATH DE number 3276423

MaRDI QIDQ5560916zbMATH OpenFDO

Authors Gary Chartrand, Dennis P. Geller, Stephen T. Hedetniemi

Publication date 1968

zbMATH Keywords

topology

Cited in

(23)

• Chromatic partitions of a graph
• A sequential coloring algorithm for finite sets
• Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs
• The complexity of \(G\)-free colourability
• Dynamic \(F\)-free coloring of graphs
• On monochromatic component size for improper colourings
• Generalizations of independence and chromatic numbers of a graph
• Conditional chromatic numbers with forbidden cycles
• The subchromatic number of a graph
• A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
• On the vertex arboricity of planar graphs of diameter two
• Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
• Chromatic sums for colorings avoiding monochromatic subgraphs
• Graphs with forbidden subgraphs
• Colorings of plane graphs without long monochromatic facial paths
• Splitting planar graphs of girth 6 into two linear forests with short paths
• WORM colorings of planar graphs
• My top 10 graph theory conjectures and open problems
• Graph theory
• On a 3-coloring of plane graphs without monochromatic facial 3-paths
• The \(t\)-tone chromatic number of random graphs
• Induced-path partition on graphs with special blocks
• The path partition conjecture is true for claw-free graphs

This page was built for publication:

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