Graphs with Hamiltonian cycles having adjacent lines different colours
From MaRDI portal
Publication:1845739
DOI10.1016/0095-8956(76)90053-8zbMath0287.05106OpenAlexW2042381090MaRDI QIDQ1845739
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(76)90053-8
Related Items (35)
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three ⋮ Some algorithmic results for finding compatible spanning circuits in edge-colored graphs ⋮ Properly coloured copies and rainbow copies of large graphs with small maximum degree ⋮ Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ Bounded colorings of multipartite graphs and hypergraphs ⋮ Properly coloured Hamiltonian paths in edge-coloured complete graphs ⋮ Properly coloured Hamiltonian cycles in edge-coloured complete graphs ⋮ Compatible spanning circuits in edge-colored graphs ⋮ Properly colored 2-factors of edge-colored complete bipartite graphs ⋮ Graph Tilings in Incompatibility Systems ⋮ Proper‐walk connection number of graphs ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ Long properly colored cycles in edge colored complete graphs ⋮ Alternating cycles in edge-partitioned graphs ⋮ Properly colored and rainbow copies of graphs with few cherries ⋮ Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs ⋮ Almost Eulerian compatible spanning circuits in edge-colored graphs ⋮ Extending perfect matchings to Hamiltonian cycles in line graphs ⋮ Properly edge-colored theta graphs in edge-colored complete graphs ⋮ On the number of alternating paths in random graphs ⋮ Alternating Hamiltonian circuits in edge-coloured bipartite graphs ⋮ Compatible Hamilton cycles in Dirac graphs ⋮ On the number of alternating paths in bipartite complete graphs ⋮ On a problem of C. C. Chen and D. E. Daykin ⋮ On the structure of complete graphs without alternating cycles ⋮ Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP ⋮ Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles ⋮ Compatible Hamilton cycles in random graphs ⋮ Minimal colorings for properly colored subgraphs ⋮ Color degree and alternating cycles in edge-colored graphs ⋮ Alternating paths in edge-colored complete graphs ⋮ Edge-colored complete graphs with alternating cycles ⋮ Extensions of results on rainbow Hamilton cycles in uniform hypergraphs ⋮ On extremal graphs without compatible triangles or quadrilaterals
Cites Work
This page was built for publication: Graphs with Hamiltonian cycles having adjacent lines different colours
