Planar graph colorings without short monochromatic cycles

DOI10.1002/jgt.10167zbMath1042.05044OpenAlexW4254558262MaRDI QIDQ4736767

Riste Škrekovski, Tomáš Kaiser

Publication date: 6 August 2004

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10167

zbMATH Keywords

graph coloring2-factorplanar grapharboricitymonochromatic cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Disjoint total dominating sets in near‐triangulations ⋮ Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs

Cites Work

• B-sets and planar maps

This page was built for publication: Planar graph colorings without short monochromatic cycles