A property of the colored complete graph
From MaRDI portal
Publication:1253666
DOI10.1016/0012-365X(79)90020-7zbMath0397.05024WikidataQ126311933 ScholiaQ126311933MaRDI QIDQ1253666
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (23)
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 ⋮ Graph Tilings in Incompatibility Systems ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ Long properly colored cycles in edge colored complete graphs ⋮ Properly colored and rainbow copies of graphs with few cherries ⋮ Almost Eulerian compatible spanning circuits in edge-colored graphs ⋮ Properly edge-colored theta graphs in edge-colored complete graphs ⋮ On the number of alternating paths in random graphs ⋮ Compatible Hamilton cycles in Dirac graphs ⋮ On the number of alternating paths in bipartite complete graphs ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles ⋮ Compatible Hamilton cycles in random graphs ⋮ Properly Coloured Cycles and Paths: Results and Open Problems ⋮ Color degree and alternating cycles in edge-colored graphs ⋮ Edge-colored complete graphs with alternating cycles ⋮ Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs ⋮ Extensions of results on rainbow Hamilton cycles in uniform hypergraphs
Cites Work
This page was built for publication: A property of the colored complete graph
