Properly colored paths and cycles

DOI10.1016/j.dam.2011.06.005zbMath1228.05150OpenAlexW2035428221MaRDI QIDQ642961

Shinya Fujita, Colton Magnant

Publication date: 27 October 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.06.005

zbMATH Keywords

edge-colored graphsproperly colored cyclesproperly colored paths

Mathematics Subject Classification ID

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

Related Items

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 ⋮ Exact approaches for the orderly colored longest path problem: performance comparison ⋮ Acyclicity in edge-colored graphs ⋮ Alternating-pancyclism in 2-edge-colored graphs ⋮ Cycle extension in edge-colored complete graphs ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles ⋮ Maximum properly colored trees in edge-colored graphs ⋮ Properly coloured Hamiltonian cycles in edge-coloured complete graphs ⋮ Compatible spanning circuits in edge-colored graphs ⋮ Note on rainbow cycles in edge-colored graphs ⋮ Minimum <scp>color‐degree</scp> perfect b‐matchings ⋮ A classification of edge-colored graphs based on properly colored walks ⋮ 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 ⋮ Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) ⋮ Proper connection of graphs ⋮ Long properly colored cycles in edge colored complete 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 Dirac Type Condition for Properly Coloured Paths and Cycles ⋮ 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 ⋮ Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs ⋮ Acyclic Digraphs ⋮ Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs ⋮ Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs ⋮ \(H\)-cycles in \(H\)-colored multigraphs ⋮ Note on rainbow triangles in edge-colored graphs

Cites Work

• On rainbow connection
• Color degree and alternating cycles in edge-colored graphs
• Hamiltonian circuits determining the order of chromosomes
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Rainbow connection in graphs
• Digraphs
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item