A note on mixed tree coloring

DOI10.1016/J.IPL.2007.11.003MaRDI QIDQ963351zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A note on trees colouring
• scientific article; zbMATH DE number 1696541
• Coloring mixed hypertrees
• About uniquely colorable mixed hypertrees
• A note on edge colorings and trees
• THE COLORING OF THE TREE OF COLORINGS
• scientific article; zbMATH DE number 1839477
• Note about the upper chromatic number of mixed hypertrees
• scientific article; zbMATH DE number 1929966
• Multicolored trees in complete graphs

Cites work

• scientific article; zbMATH DE number 1731177 (Why is no real title available?)
• Coloring some classes of mixed graphs
• Mixed graph colorings
• Scheduling Problems and Mixed Graph Colorings

Cited in

(4)

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

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

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