Rainbow and properly colored spanning trees in edge-colored bipartite graphs

DOI10.1007/s00373-021-02334-5zbMath1479.05108OpenAlexW3170108484MaRDI QIDQ2051897

Masao Tsugaki, Mikio Kano

Publication date: 25 November 2021

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

Full work available at URL: https://doi.org/10.1007/s00373-021-02334-5

zbMATH Keywords

bipartite graphrainbow spanning treeedge-colored bipartite graphproperly colored spanning tree

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Colored constrained spanning tree on directed graphs

Cites Work

• Spanning \(k\)-ended trees of bipartite graphs
• Spanning \(k\)-trees of bipartite graphs
• Factors and factorizations of graphs. Proof techniques in factor theory
• Spanning trees: A survey
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• Color degree sum conditions for properly colored spanning trees in edge-colored graphs
• Properly colored spanning trees in edge-colored graphs
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• Independence trees and Hamilton cycles
• Multicolored trees in complete graphs

This page was built for publication: Rainbow and properly colored spanning trees in edge-colored bipartite graphs