Compatible spanning circuits in edge-colored graphs

DOI10.1016/j.disc.2020.111908zbMath1440.05088MaRDI QIDQ2182217

Sheng Gui Zhang, Zhi-Wei Guo, Bin Long Li, Xue Liang Li

Publication date: 21 May 2020

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

Full work available at URL: https://research.utwente.nl/en/publications/compatible-spanning-circuits-in-edgecolored-graphs(a8fa7af6-111f-4cb9-8de7-edc7a90b2df6).html

zbMATH Keywords

edge-colored graphsupereulerian graphcompatible spanning circuitspanning Eulerian subgraphore-type degree condition

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

Compatible spanning circuits and forbidden induced subgraphs, Some algorithmic results for finding compatible spanning circuits in edge-colored graphs, On supereulerian 2-edge-coloured graphs, Almost Eulerian compatible spanning circuits in edge-colored graphs, Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chinese postman problem on edge-colored multigraphs
• Properly colored paths and cycles
• New sufficient conditions for cycles in graphs
• Graphs with cycles having adjacent lines different colors
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• Alternating Hamiltonian cycles
• A property of the colored complete graph
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Graphs with Hamiltonian cycles having adjacent lines different colours
• A note on graphs spanned by Eulerian graphs
• Supereulerian graphs: A survey
• The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
• Digraphs