Graphs with cycles having adjacent lines different colors

DOI10.1016/0095-8956(76)90007-1zbMath0316.05106OpenAlexW1995721898MaRDI QIDQ1221118

No author found.

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)90007-1

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (18)

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 ⋮ Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ Properly coloured Hamiltonian cycles in edge-coloured complete graphs ⋮ Compatible spanning circuits in edge-colored graphs ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ Alternating cycles in edge-partitioned graphs ⋮ 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 ⋮ Alternating Hamiltonian circuits in edge-coloured bipartite graphs ⋮ Compatible Hamilton cycles in Dirac graphs ⋮ A property of the colored complete graph ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles ⋮ Compatible Hamilton cycles in random graphs ⋮ Edge-colored complete graphs with alternating cycles ⋮ On extremal graphs without compatible triangles or quadrilaterals

Cites Work

• Unnamed Item

This page was built for publication: Graphs with cycles having adjacent lines different colors