scientific article; zbMATH DE number 1067836

DOI10.1002/(SICI)1098-2418(199709)11:2%3C179::AID-RSA5%3E3.0.CO;2-PMaRDI QIDQ4358434zbMATH OpenFDO

Authors Noga Alon, G. Gutin

Publication date 2 March 1998

Full work available at URL https://doi.org/10.1002/(SICI)1098-2418(199709)11:2%3C179::AID-RSA5%3E3.0.CO;2-P

zbMATH Keywords

cycleedge coloringHamilton cyclesproper coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Long properly colored cycles in edge colored complete graphs
• Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs
• Properly colored cycles of different lengths in edge-colored complete graphs
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Hamilton circuits with many colours in properly edge-coloured complete graphs.

Cited in

(62)

• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Color degree and alternating cycles in edge-colored graphs
• Multicolored parallelisms of Hamiltonian cycles
• 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
• Multicoloured Hamilton cycles
• A note on equitable Hamiltonian cycles
• On the number of alternating paths in bipartite complete graphs
• Edge-colored complete graphs containing no properly colored odd cycles
• Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs
• Disjoint properly colored cycles in edge-colored complete bipartite graphs
• Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs
• \(H\)-cycles in \(H\)-colored multigraphs
• 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
• Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs
• Extensions of results on rainbow Hamilton cycles in uniform hypergraphs
• Bounded colorings of multipartite graphs and hypergraphs
• Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs
• Long properly colored cycles in edge colored complete graphs
• On properly colored Hamiltonian cycles in cubes of distance-colored grids
• 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
• Cycles avoiding a color in colorful graphs
• 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
• Long Alternating Cycles in Edge-Colored Complete Graphs
• Properly coloured cycles and paths: Results and open problems
• scientific article; zbMATH DE number 4073019 (Why is no real title available?)
• Hamilton circuits with many colours in properly edge-coloured complete graphs.
• scientific article; zbMATH DE number 54775 (Why is no real title available?)
• Polychromatic colorings of complete graphs with respect to 1‐, 2‐factors and Hamiltonian cycles
• scientific article; zbMATH DE number 845478 (Why is no real title available?)
• Odd properly colored cycles in edge-colored graphs
• scientific article; zbMATH DE number 7566051 (Why is no real title available?)
• On rainbow cycles in edge colored complete graphs
• A Dirac type condition for properly coloured paths and cycles
• Comment on ``Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles.
• Graph Tilings in Incompatibility Systems
• Properly colored cycles of different lengths in edge-colored complete graphs
• Edge-disjoint properly colored cycles in edge-colored complete graphs
• On the existence of cycles with restrictions in the color transitions in edge-colored complete graphs
• Compatible powers of Hamilton cycles in dense graphs
• Compatible Hamilton cycles in Dirac graphs
• Polychromatic Hamilton cycles
• Properly colored even cycles in edge-colored complete balanced bipartite graphs
• Properly colored spanning trees via subdivision of a given tree in monochromatic triangle-free edge-colored complete graphs
• What must and what need not be contained in a graph of uncountable chromatic number?
• Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
• Edge-colourings of \(K_{n,n}\) with no long two-coloured cycles
• Cycles of given length in oriented graphs
• Hamiltonian degree sequences in digraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4358434)