On Chromatic Number of Colored Mixed Graphs

DOI10.1007/978-3-319-53007-9_12zbMath1487.05089arXiv1508.07222OpenAlexW2211583765MaRDI QIDQ2971641

Soumen Nandi, Sandip Das, Sagnik Sen

Publication date: 7 April 2017

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.07222

zbMATH Keywords

acyclic chromatic numberchromatic numberarboricitycolored mixed graphsgraphs with bounded maximum degree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

On the signed chromatic number of some classes of graphs ⋮ The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree ⋮ Smaller universal targets for homomorphisms of edge-colored graphs ⋮ On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets ⋮ On clique numbers of colored mixed graphs

Cites Work

• Unnamed Item
• Homomorphisms and colourings of oriented graphs: an updated survey
• On acyclic colorings of planar graphs
• Homomorphisms of edge-colored graphs and Coxeter groups
• Good and semi-strong colorings of oriented planar graphs
• Colored homomorphisms of colored mixed graphs
• Acyclic and oriented chromatic numbers of graphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: On Chromatic Number of Colored Mixed Graphs