A note on mixed tree coloring

DOI10.1016/j.ipl.2007.11.003zbMath1185.90075OpenAlexW2046904044MaRDI QIDQ963351

Hanna Furmańczyk, Adrian Kosowski, Paweł Żyliński

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.11.003

zbMATH Keywords

treesgraph algorithmsmixed graph coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Coloring mixed and directional interval graphs ⋮ Complexity of two coloring problems in cubic planar bipartite mixed graphs ⋮ Mixed graph edge coloring

Cites Work

• Unnamed Item
• Coloring some classes of mixed graphs
• Mixed graph colorings
• Scheduling Problems and Mixed Graph Colorings

This page was built for publication: A note on mixed tree coloring