Parity vertex colouring of graphs

DOI10.7151/DMGT.1537zbMATH Open1284.05091DBLPjournals/dmgt/BorowieckiBJK11OpenAlexW1978719437WikidataQ62043617 ScholiaQ62043617MaRDI QIDQ3171425FDOQ3171425

Authors: Piotr Borowiecki, Kristína. Budajová, Stanislav Krajči, Stanislav Jendroľ 

Publication date: 5 October 2011

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

Full work available at URL: https://semanticscholar.org/paper/394931d9a96e387074b04e3b30de7e771be5a682

Recommendations

• Parity vertex colorings of binomial trees
• Parity vertex colouring of plane graphs
• Parity vertex coloring of outerplane graphs
• An improved bound on parity vertex colourings of outerplane graphs
• On vertex-parity edge-colorings

zbMATH Keywords

treehypercubevertex rankingFibonacci numbergraph colouringordered colouringparity colouring

Mathematics Subject Classification ID

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

Cited In (6)

• Parity vertex colouring of plane graphs
• Conflict-free connection of trees
• An improved bound on parity vertex colourings of outerplane graphs
• On the parity of colourings and flows
• Parity vertex colorings of binomial trees
• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods

This page was built for publication: Parity vertex colouring of graphs

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