Fall colouring of bipartite graphs and Cartesian products of graphs

DOI10.1016/j.dam.2008.03.003zbMath1156.05020OpenAlexW2134301227MaRDI QIDQ1003677

Jeremy Lyle, Renu C. Laskar

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.003

zbMATH Keywords

hypercubeCartesian productidomatic partitiondomatic partitionfall colouringidomatic numberindominable

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Coloring problems on bipartite graphs of small diameter ⋮ On the number of maximal independent sets in minimum colorings of split graphs ⋮ Graphs with small fall-spectrum ⋮ Color chain of a graph ⋮ On graph fall-coloring: existence and constructions ⋮ Complexity of fall coloring for restricted graph classes

Cites Work

• Sur le nombre domatique du n-cube et une conjecture de Zelinka. (On the domatic number of the n-cube and a conjecture of Zelinka)
• The b-chromatic number of a graph
• Two-Processor Scheduling with Start-Times and Deadlines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fall colouring of bipartite graphs and Cartesian products of graphs