Cycles and paths in edge‐colored graphs with given degrees

DOI10.1002/jgt.20440zbMath1202.05067OpenAlexW4233572056MaRDI QIDQ3055905

No author found.

Publication date: 10 November 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20440

zbMATH Keywords

hamiltonian graphedge-colored graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (14)

Exact approaches for the orderly colored longest path problem: performance comparison ⋮ Acyclicity in edge-colored graphs ⋮ Proper Hamiltonian cycles in edge-colored multigraphs ⋮ Proper Hamiltonian paths in edge-coloured multigraphs ⋮ Parallel connectivity in edge-colored complete graphs: complexity results ⋮ Proper connection of graphs ⋮ Fork-forests in bi-colored complete bipartite graphs ⋮ A note on equitable Hamiltonian cycles ⋮ Odd properly colored cycles in edge-colored graphs ⋮ Chinese postman problem on edge-colored multigraphs ⋮ A Dirac Type Condition for Properly Coloured Paths and Cycles ⋮ A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs ⋮ Properly Coloured Cycles and Paths: Results and Open Problems ⋮ Paths and trails in edge-colored weighted graphs

Cites Work

• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Alternating Hamiltonian cycles
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Characterization of edge-colored complete graphs with properly colored Hamilton paths
• Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycles and paths in edge‐colored graphs with given degrees