Odd chromatic number of graph classes

DOI10.1002/JGT.23200MaRDI QIDQ7009625zbMATH OpenFDO

Authors Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos

Publication date 20 March 2025

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/JGT.23200

zbMATH Keywords

colouring variantgraph classesodd colouringupper boundsvertex partition problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Cites work

• Asteroidal Triple-Free Graphs
• Chromatic number, girth and maximal degree
• Colorings with neighborhood parity condition
• Every graph contains a linearly sized induced subgraph with all degrees odd
• Graph Theory and Probability
• scientific article; zbMATH DE number 487720 (Why is no real title available?)
• On induced subgraphs with all degree odd
• On induced subgraphs with odd degrees
• On the complexity of finding large odd induced subgraphs and odd colorings
• On the precise value of the strong chromatic index of a planar graph with a large girth
• Vertex partitioning of graphs into odd induced subgraphs

This page was built for publication: Odd chromatic number of graph classes

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