Sufficient conditions for the existence of spanning colored trees in edge-colored graphs

DOI10.1016/J.DISC.2012.01.031MaRDI QIDQ442397zbMATH OpenOpenAlexFDO

Authors V. Borozan, Y. Manoussakis, R. Águeda, G. Mendy, R. Muthu

Publication date 10 August 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2012.01.031

zbMATH Keywords

sufficient conditionsedge-colored graphsproper spanning trees

Mathematics Subject Classification ID

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

Recommendations

• Color degree sum conditions for properly colored spanning trees in edge-colored graphs
• Properly colored spanning trees in edge-colored graphs
• Spanning trees with many or few colors in edge-colored graphs
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• Rainbow and properly colored spanning trees in edge-colored bipartite graphs
• Feasible edge colorings of trees with cardinality constraints
• On the number of rainbow spanning trees in edge-colored complete graphs
• Maximum properly colored trees in edge-colored graphs
• A note on edge colorings and trees
• Maximum colored trees in edge-colored graphs

Cites work

• scientific article; zbMATH DE number 1557065 (Why is no real title available?)
• scientific article; zbMATH DE number 1764950 (Why is no real title available?)
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• Characterization of edge-colored complete graphs with properly colored Hamilton paths
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Graph folding and programmable logic array
• Graph theory
• Maximum colored trees in edge-colored graphs
• Multicolored forests in complete bipartite graphs
• Multicolored trees in complete graphs
• The Parallel Evaluation of General Arithmetic Expressions

Cited in

(5)

• Compatible spanning circuits and forbidden induced subgraphs
• Properly colored spanning trees in edge-colored graphs
• Color degree sum conditions for properly colored spanning trees in edge-colored graphs
• Maximum colored trees in edge-colored graphs
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph

This page was built for publication: Sufficient conditions for the existence of spanning colored trees in edge-colored graphs

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