Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs

DOI10.1002/JGT.22536MaRDI QIDQ5066899zbMATH OpenOpenAlexWikidataFDO

Authors Ruonan Li, Hajo Broersma, Shenggui Zhang

Publication date 31 March 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

complete graphedge-colored graphmultipartite tournamentproperly edge-colored cyclevertex-disjoint cycles

Mathematics Subject Classification ID

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

Recommendations

• Properly colored cycles of different lengths in edge-colored complete graphs
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
• Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
• Disjoint properly colored cycles in edge-colored complete bipartite graphs
• Long properly colored cycles in edge colored complete graphs

Cited in

(15)

• Vertex-disjoint rainbow triangles in edge-colored graphs
• Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs
• Rainbow edge-pancyclicity of strongly edge-colored graphs
• Disjoint properly colored cycles in edge-colored complete bipartite graphs
• Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs
• On connectivities of edge-colored graphs
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
• Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
• Note on edge-colored graphs and digraphs without properly colored cycles
• Properly colored cycles of different lengths in edge-colored complete graphs
• Edge-disjoint properly colored cycles in edge-colored complete graphs
• Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs
• Properly colored spanning trees via subdivision of a given tree in monochromatic triangle-free edge-colored complete graphs
• The parameterized complexity of the properly colored spanning tree problem

This page was built for publication: Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066899)