Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
From MaRDI portal
Publication:1306426
DOI10.1006/jctb.1998.1868zbMath0930.05043OpenAlexW2090014838MaRDI QIDQ1306426
Publication date: 4 October 1999
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1998.1868
Related Items (28)
Degree Ramsey Numbers of Graphs ⋮ An improved upper bound on the linear 2-arboricity of 1-planar graphs ⋮ Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles ⋮ Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph ⋮ On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\) ⋮ Relaxed two-coloring of cubic graphs ⋮ Graph coloring with no large monochromatic components ⋮ Bounded size components -- partitions and transversals. ⋮ The linear 2-arboricity of IC-planar graphs ⋮ Partitioning into graphs with only small components ⋮ The linear 2-arboricity of sparse graphs ⋮ Linear 2-arboricity of toroidal graphs ⋮ The linear 3-arboricity of \(K_{n,n}\) and \(K_n\) ⋮ Deciding Relaxed Two-Colourability: A Hardness Jump ⋮ An improved upper bound on the linear 2-arboricity of planar graphs ⋮ Isomorphic bisections of cubic graphs ⋮ On isomorphic linear partitions in cubic graphs ⋮ The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\) ⋮ On isomorphic linear partitions in cubic graphs ⋮ On monochromatic component size for improper colourings ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles ⋮ Planar graphs without 5-cycles or without 6-cycles ⋮ On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks ⋮ Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree ⋮ Light structures in 1-planar graphs with an application to linear 2-arboricity ⋮ The linear \((n - 1)\)-arboricity of some lexicographic product graphs ⋮ The linear 2-arboricity of 1-planar graphs without 3-cycles
Cites Work
This page was built for publication: Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
