An Edge-Colored Version of Dirac's Theorem
From MaRDI portal
Publication:4979820
DOI10.1137/120903750zbMath1297.05085arXiv1212.6735OpenAlexW2025303835MaRDI QIDQ4979820
Publication date: 19 June 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.6735
Related Items
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, Properly coloured Hamiltonian cycles in edge-coloured complete graphs, Properly colored 2-factors of edge-colored complete bipartite graphs, Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs, Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs, Rainbow vertex-pancyclicity of strongly edge-colored graphs, Rainbow Hamiltonian cycles in strongly edge-colored graphs, Properly edge-colored theta graphs in edge-colored complete graphs, Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result, 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, Rainbow pancyclicity in graph systems, 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, Rainbow edge-pancyclicity of strongly edge-colored graphs, Acyclic Digraphs