Fall colouring of bipartite graphs and Cartesian products of graphs

DOI10.1016/J.DAM.2008.03.003MaRDI QIDQ1003677zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Complexity of fall coloring for restricted graph classes
• Complexity of fall coloring for restricted graph classes
• scientific article; zbMATH DE number 1506511
• On graph fall-coloring -- operators and heredity
• On graph fall-coloring: existence and constructions

Cites work

• scientific article; zbMATH DE number 3983200 (Why is no real title available?)
• scientific article; zbMATH DE number 3765843 (Why is no real title available?)
• scientific article; zbMATH DE number 1202982 (Why is no real title available?)
• scientific article; zbMATH DE number 2080268 (Why is no real title available?)
• scientific article; zbMATH DE number 1506511 (Why is no real title available?)
• scientific article; zbMATH DE number 3799700 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• scientific article; zbMATH DE number 1444489 (Why is no real title available?)
• scientific article; zbMATH DE number 3298599 (Why is no real title available?)
• Differentials in graphs
• Fall colorings on Cartesian products and regular graphs
• Independent domatic partitioning or fall coloring of strongly chordal graphs
• 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

Cited in

(9)

• Coloring problems on bipartite graphs of small diameter
• Complexity of fall coloring for restricted graph classes
• \(b\)-coloring parameterized by clique-width
• On the number of maximal independent sets in minimum colorings of split graphs
• On graph fall-coloring: existence and constructions
• Complexity of fall coloring for restricted graph classes
• scientific article; zbMATH DE number 1506511 (Why is no real title available?)
• Color chain of a graph
• Graphs with small fall-spectrum

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

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