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

DOI10.1007/S00373-021-02334-5MaRDI QIDQ2051897zbMATH OpenOpenAlexFDO

Authors 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 graphedge-colored bipartite graphproperly colored spanning treerainbow spanning tree

Mathematics Subject Classification ID

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

Recommendations

• Rainbow spanning trees in properly coloured complete graphs
• On the number of rainbow spanning trees in edge-colored complete graphs
• Rainbow trees in uniformly edge‐colored graphs
• Properly colored spanning trees in edge-colored graphs
• Edge-disjoint rainbow trees in properly coloured complete graphs
• Rainbow spanning trees in complete graphs colored by one‐factorizations
• Edge-disjoint rainbow spanning trees in complete graphs
• Edge-colorings of complete bipartite graphs without large rainbow trees
• Spanning trees with many or few colors in edge-colored graphs
• Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations

Cites work

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

Cited in

(17)

• Edge-disjoint rainbow trees in properly coloured complete graphs
• Color degree sum conditions for properly colored spanning trees in edge-colored graphs
• Properly colored spanning trees in edge-colored graphs
• A generalization of heterochromatic graphs and \(f\)-chromatic spanning forests
• scientific article; zbMATH DE number 7219311 (Why is no real title available?)
• Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
• Rainbow spanning trees in complete graphs colored by one‐factorizations
• An f-chromatic spanning forest of edge-colored complete bipartite graphs
• Rainbow trees in uniformly edge‐colored graphs
• Colored constrained spanning tree on directed graphs
• Approximating maximum-size properly colored forests
• Sufficient conditions for edge-colored bipartite graphs to have rainbow and properly colored spanning trees
• Properly colored even cycles in edge-colored complete balanced bipartite graphs
• Approximating maximum-size properly colored forests
• Properly colored spanning trees via subdivision of a given tree in monochromatic triangle-free edge-colored complete graphs
• The parameterized complexity of the properly colored spanning tree problem
• Rainbow \(H\)-factors

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

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