On the chromatic number of tree graphs

DOI10.1016/S0012-365X(00)00092-3zbMATH Open0969.05025OpenAlexW2007752258MaRDI QIDQ1587620FDOQ1587620

Authors: Vladimir Estivill-Castro, Marc Noy, J. Urrutia 

Publication date: 3 October 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00092-3

Recommendations

• On the tree graph of a connected graph
• Tree-chromatic number
• On a tree graph defined by a set of cycles
• scientific article; zbMATH DE number 2014472
• scientific article; zbMATH DE number 1094148

zbMATH Keywords

spanning treeschromatic numberconnected graphtree graph

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Cited In (18)

• On a tree graph defined by a set of cycles
• Exact values for theb-chromatic number of a power completek-ary tree
• The harmonious chromatic number of complete \(r\)-ary trees
• Title not available (Why is that?)
• On chromatic number and minimum cut
• Spanning trees: A survey
• On the tree graph of a connected graph
• Title not available (Why is that?)
• Geometric tree graphs of points in convex position
• Burling graphs, chromatic number, and orthogonal tree-decompositions
• Tree-chromatic number
• On the number of heterochromatic trees in nice and beautiful colorings of complete graphs
• Title not available (Why is that?)
• Entire chromatic number of 1-tree.
• Efficient computation of the modular chromatic numbers of trees
• On the basis graph of a bicolored matroid
• The edge rotation graph
• On the tree number of regular graphs

This page was built for publication: On the chromatic number of tree graphs

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