Parity vertex colorings of binomial trees

DOI10.7151/dmgt.1595zbMath1255.05081OpenAlexW2013977596MaRDI QIDQ2906376

Riste Škrekovski, Petr Gregor

Publication date: 5 September 2012

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8535d35543550ee036a0f8b47946e11b57c33ad7

zbMATH Keywords

vertex rankingbinomial treeparity coloring

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Conflict-free connection of trees ⋮ Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods

This page was built for publication: Parity vertex colorings of binomial trees