Publication:4358434

DOI<179::AID-RSA5>3.0.CO;2-P 10.1002/(SICI)1098-2418(199709)11:2<179::AID-RSA5>3.0.CO;2-PzbMath0882.05084MaRDI QIDQ4358434

Noga Alon, Gregory Gutin

Publication date: 2 March 1998

zbMATH Keywords

cycle; edge coloring; Hamilton cycles; proper coloring

Mathematics Subject Classification ID

05C38: Paths and cycles

05C15: Coloring of graphs and hypergraphs

05C20: Directed graphs (digraphs), tournaments

05C45: Eulerian and Hamiltonian graphs

Related Items

Unnamed Item, A Dirac Type Condition for Properly Coloured Paths and Cycles, Properly colored and rainbow copies of graphs with few cherries, Graph Tilings in Incompatibility Systems, Compatible Hamilton cycles in Dirac graphs, Some algorithmic results for finding compatible spanning circuits in edge-colored graphs, Cycles of given length in oriented graphs, Hamiltonian degree sequences in digraphs, Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey, Color degree and alternating cycles in edge-colored graphs, Alternating cycles and paths in edge-coloured multigraphs: A survey, Properly coloured Hamiltonian paths in edge-coloured complete graphs, Properly coloured Hamiltonian cycles in edge-coloured complete graphs, Properly edge-colored theta graphs in edge-colored complete graphs, On the number of alternating paths in bipartite complete graphs, Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs, Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs, Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three, Maximum properly colored trees in edge-colored graphs, Compatible spanning circuits in edge-colored graphs, Almost Eulerian compatible spanning circuits in edge-colored graphs, On the number of alternating paths in random graphs, Symbolic coloured SCC decomposition, Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles, Extensions of results on rainbow Hamilton cycles in uniform hypergraphs, Bounded colorings of multipartite graphs and hypergraphs, Long properly colored cycles in edge colored complete graphs, Fork-forests in bi-colored complete bipartite graphs, Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles, Properly colored 2-factors of edge-colored complete bipartite graphs, Properly colored Hamilton cycles in Dirac-type hypergraphs, Compatible Hamilton cycles in random graphs, Properly coloured copies and rainbow copies of large graphs with small maximum degree, Cycles and paths in edge‐colored graphs with given degrees, Properly Coloured Cycles and Paths: Results and Open Problems