A generalization of heterochromatic graphs and f-chromatic spanning forests

DOI10.1007/S00373-011-1125-ZzbMATH Open1267.05126arXiv1102.4802OpenAlexW1967700686MaRDI QIDQ2376091FDOQ2376091

Authors: Kazuhiro Suzuki 

Publication date: 26 June 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: In 2006, Suzuki, and Akbari & Alipour independently presented a necessary and sufficient condition for edge-colored graphs to have a heterochromatic spanning tree, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors. In this paper, we propose $f$-chromatic graphs as a generalization of heterochromatic graphs. An edge-colored graph is $f$-chromatic if each color $c$ appears on at most $f(c)$ edges. We also present a necessary and sufficient condition for edge-colored graphs to have an $f$-chromatic spanning forest with exactly $m$ components. Moreover, using this criterion, we show that a $g$-chromatic graph $G$ of order $n$ with $$ has an $f$-chromatic spanning forest with exactly $m$ ($1lemlen-1$) components if $g(c)lefrac|E(G)|n-mf(c)$ for any color $c$.

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

Recommendations

• An f-chromatic spanning forest of edge-colored complete bipartite graphs
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• \((g,f)\)-chromatic spanning trees and forests
• Partitioning complete graphs by heterochromatic trees
• Rainbow and properly colored spanning trees in edge-colored bipartite graphs

zbMATH Keywords

rainbowedge-coloringspanning treespanning forestheterochromaticmulticoloredtotally multicoloredpolychromatic\(f\)-chromatic\(k\)-bounded coloringcolorful

Mathematics Subject Classification ID

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

Cites Work

• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• Multicoloured Hamilton cycles
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• Multicolored trees in complete graphs
• Multicolored trees in complete graphs

Cited In (4)

• \(k\)-forested coloring of sparse graphs
• \((g,f)\)-chromatic spanning trees and forests
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• An f-chromatic spanning forest of edge-colored complete bipartite graphs

This page was built for publication: A generalization of heterochromatic graphs and \(f\)-chromatic spanning forests

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