Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5.
Carsten ThomassenPublished in: J. Comb. Theory, Ser. B (1999)
Keyphrases
- directed graph
- weighted graph
- edge weights
- path length
- spanning tree
- shortest path
- directed acyclic graph
- undirected graph
- strongly connected
- random walk
- graph theory
- shortest path problem
- solution path
- vertex set
- directed edges
- root node
- massive graphs
- nodes of a graph
- bipartite graph
- graph theoretic
- small world
- strongly connected components
- maximum matching
- total length
- edge detector
- connected components
- software components
- social networks
- structured data
- b spline
- maximum number
- closed contours
- graph structure
- link analysis
- minimum cost
- graph representation