A Dirac Type Condition for Properly Coloured Paths and Cycles

DOI10.1002/jgt.21751zbMath1294.05077arXiv1008.3242OpenAlexW1784357865MaRDI QIDQ5418769

Allan Lo

Publication date: 28 May 2014

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

Full work available at URL: https://arxiv.org/abs/1008.3242

zbMATH Keywords

pathscyclesproper edge colouringcolour degree

Mathematics Subject Classification ID

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

Related Items (18)

Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three ⋮ Exact approaches for the orderly colored longest path problem: performance comparison ⋮ Acyclicity in edge-colored graphs ⋮ Cycle extension in edge-colored complete graphs ⋮ Maximum properly colored trees in edge-colored graphs ⋮ Properly coloured Hamiltonian cycles in edge-coloured complete graphs ⋮ Properly colored 2-factors of edge-colored complete bipartite graphs ⋮ Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs ⋮ Properly edge-colored theta graphs in edge-colored complete graphs ⋮ Odd properly colored cycles in edge-colored graphs ⋮ Chinese postman problem on edge-colored multigraphs ⋮ A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs ⋮ Properly colored spanning trees in edge-colored graphs ⋮ Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles ⋮ Properly colored short cycles in edge-colored graphs ⋮ Acyclic Digraphs ⋮ Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs

Cites Work

• Unnamed Item
• Properly colored paths and cycles
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Color degree and alternating cycles in edge-colored graphs
• Alternating cycles in edge-partitioned graphs
• Hamiltonian circuits in random graphs
• Alternating Hamiltonian cycles
• A note on alternating cycles in edge-coloured graphs
• Cycles and paths in edge‐colored graphs with given degrees
• One-factorizations of the complete graph—A survey
• Digraphs

This page was built for publication: A Dirac Type Condition for Properly Coloured Paths and Cycles