Rainbow and properly colored spanning trees in edge-colored bipartite graphs
From MaRDI portal
Publication:2051897
DOI10.1007/S00373-021-02334-5zbMATH Open1479.05108OpenAlexW3170108484MaRDI QIDQ2051897FDOQ2051897
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
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
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)
Cites Work
- Factors and factorizations of graphs. Proof techniques in factor theory
- Spanning trees: A survey
- A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
- Multicolored trees in complete graphs
- Spanning \(k\)-ended trees of bipartite graphs
- Independence trees and Hamilton cycles
- Color degree sum conditions for properly colored spanning trees in edge-colored graphs
- Properly colored spanning trees in edge-colored graphs
- Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
- Spanning \(k\)-trees of bipartite graphs
Cited In (11)
- Colored constrained spanning tree on directed graphs
- Rainbow spanning trees in complete graphs colored by one‐factorizations
- Edge-disjoint rainbow trees in properly coloured complete graphs
- Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
- A generalization of heterochromatic graphs and \(f\)-chromatic spanning forests
- Title not available (Why is that?)
- Rainbow trees in uniformly edge‐colored graphs
- Color degree sum conditions for properly colored spanning trees in edge-colored graphs
- Properly colored spanning trees in edge-colored graphs
- An f-chromatic spanning forest of edge-colored complete bipartite graphs
- 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)
