Rainbow spanning trees in complete graphs colored by one‐factorizations

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Journal of Graph Theory

• Publication date

  2018-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1002/jgt.22160
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three

  2017influential reference
• Edge-disjoint rainbow spanning trees in complete graphs

  2016cited by this paper
• Random graphs

  2006cited by this paper
• A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph

  2006influential reference
• Matroids, trees, stable sets

  2003cited by this paper
• Combinatorial optimization. Polyhedra and efficiency.

  2003cited by this paper
• Concentration for Independent Permutations

  2002cited by this paper
• Graph Colouring and the Probabilistic Method

  2001cited by this paper
• Spanning Trees Orthogonal to One-Factorizations of K2n

  2000cited by this paper
• Multicolored Trees in Complete Graphs

  1996cited by this paper
• Almost All Cubic Graphs Are Hamiltonian

  1992cited by this paper
• Combinatorial Optimization

  1992influential reference
• Almost all Regular Graphs are Hamiltonian

  1983cited by this paper

• Efficiently Coloring the Intersection of a General Matroid and Partition Matroids

  2025cites this paper
• Rainbow Bases in Matroids

  2022cites this paper
• On the complexity of packing rainbow spanning trees

  2022cites this paper
• Quaternionic 1-Factorizations and Complete Sets of Rainbow Spanning Trees

  2022cites this paper
• Maximum properly colored trees in edge-colored graphs

  2021cites this paper
• Regular 1-factorizations of complete graphs and decompositions into pairwise isomorphic rainbow spanning trees∗

  2021cites this paper
• University of Birmingham Decompositions into isomorphic rainbow spanning trees

  2020cites this paper
• An extremal problem on rainbow spanning trees in graphs

  2020cites this paper
• Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations

  2019cites this paper
• Decompositions into isomorphic rainbow spanning trees

  2019cites this paper
• Applications of Geometric and Spectral Methods in Graph Theory

  2019cites this paper
• Halfway to Rota’s Basis Conjecture

  2018cites this paper
• (g, f)-Chromatic spanning trees and forests

  2018cites this paper
• Decompositions into spanning rainbow structures

  2018cites this paper
• C O ] 1 7 O ct 2 01 8 Halfway to Rota ’ s basis conjecture

  2018cites this paper
• Rainbow spanning trees in properly coloured complete graphs

  2017cites this paper
• Many edge-disjoint rainbow spanning trees in general graphs

  2017cites this paper
• Linearly many rainbow trees in properly edge-coloured complete graphs

  2017cites this paper
• On the number of rainbow spanning trees in edge-colored complete graphs

  2016influential citation
• Edge-disjoint rainbow spanning trees in complete graphs

  2016cites this paper