A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Graphs Comb.

• Publication date

  2006-06-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00373-006-0662-3
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A lower bound for the length of a partial transversal in a Latin square

  2008cited by this paper
• Rainbow numbers for matchings and complete graphs

  2004cited by this paper
• Multicolored forests in complete bipartite graphs

  2001cited by this paper
• On the existence of rainbows in 1‐factorizations of K2n

  1998cited by this paper
• Multicolored Trees in Complete Graphs

  1996cited by this paper
• Multicoloured Hamilton Cycles

  1995cited by this paper
• Rainbow coloring the cube

  1993cited by this paper
• Rainbow Subgraphs in Properly Edge-colored Graphs

  1992cited by this paper
• Multicolored forests in bipartite decompositions of graphs

  1991cited by this paper
• A new proof of a theorem of Graham and Pollak

  1984cited by this paper
• On the decomposition of kn into complete bipartite graphs

  1982cited by this paper
• On embedding graphs in squashed cubes

  1972cited by this paper
• On the addressing problem for loop switching

  1971cited by this paper

• Sufficient conditions for edge-colored bipartite graphs to have rainbow and properly colored spanning trees

  2026cites this paper
• Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)

  2024cites this paper
• Hypertree Shrinking Avoiding Low Degree Vertices

  2024cites this paper
• Spanning Plane Subgraphs of 1‐Plane Graphs

  2024cites this paper
• Rainbow spanning trees in randomly coloured Gk-out

  2022cites this paper
• Anti-Ramsey number of disjoint rainbow bases in all matroids

  2021cites this paper
• Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs

  2021cites this paper
• On the Number of Heterochromatic Trees in Nice and Beautiful Colorings of Complete Graphs

  2021cites this paper
• Fe b 20 21 RAINBOW SPANNING TREES IN RANDOM EDGE-COLORED GRAPHS

  2021cites this paper
• Rainbow trees in uniformly edge‐colored graphs

  2021cites this paper
• Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs

  2021cites this paper
• Rainbow spanning trees in random subgraphs of dense regular graphs

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

  2021influential citation
• The Rainbow Steiner Tree Problem

  2021cites this paper
• Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees

  2020cites this paper
• Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra

  2020cites this paper
• Color degree sum conditions for properly colored spanning trees in edge-colored graphs

  2020cites this paper
• Properly colored spanning trees in edge-colored graphs

  2020cites this paper
• A new approach for the rainbow spanning forest problem

  2019cites this paper
• Maximum colored trees in edge-colored graphs

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

  2019cites this paper
• Rainbow spanning trees in complete graphs colored by one‐factorizations

  2018influential citation
• (g, f)-Chromatic spanning trees and forests

  2018cites this paper
• Color-disjoint rainbow spanning trees of edge-colored graphs.

  2018influential citation
• Many edge-disjoint rainbow spanning trees in general graphs

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

  2017cites this paper
• On the complexity of rainbow spanning forest problem

  2017cites this paper
• The rainbow spanning forest problem

  2017cites this paper
• Edge-disjoint rainbow spanning trees in complete graphs

  2016cites this paper
• Results on edge-colored graphs and pancyclicity

  2014cites this paper
• Algorithmic and structural aspects of graph partitioning and related problems

  2014cites this paper
• Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs

  2013cites this paper
• Color degree and heterochromatic cycles in edge-colored graphs

  2012cites this paper
• A Note on Heterochromatic C4 in Edge-Colored Triangle-Free Graphs

  2012cites this paper
• Sufficient conditions for the existence of spanning colored trees in edge-colored graphs

  2012cites this paper
• A Generalization of Heterochromatic Graphs and f-Chromatic Spanning Forests

  2012cites this paper
• An f-chromatic spanning forest of edge-colored complete bipartite graphs

  2011cites this paper
• A Note on Heterochromatic C4 in Edge-Colored Triangle-Free Graphs

  2011cites this paper
• Proper and weak-proper trees in edges-colored graphs and multigraphs. (Arbres proprement et faiblement arêtes-coloriées dans les graphes et multigraphes arêtes-coloriées)

  2011cites this paper
• A Generalization of Heterochromatic Graphs and f-Chromatic Spanning Forests

  2011cites this paper
• Cycle-minors and subdivisions of wheels

  2009cites this paper
• Rainbow faces in edge‐colored plane graphs

  2009cites this paper
• Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey

  2008cites this paper
• Heterochromatic Matchings in Edge-Colored Graphs

  2008cites this paper
• 23 Optimization for Continuous Shortest Paths in Transportation

  2008cites this paper