Almost Eulerian compatible spanning circuits in edge-colored graphs

DOI10.1016/j.disc.2020.112174zbMath1455.05039OpenAlexW3092391959MaRDI QIDQ2219966

Bin Long Li, Sheng Gui Zhang, Zhi-Wei Guo, Hajo J. Broersma

Publication date: 21 January 2021

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

Full work available at URL: https://doi.org/10.1016/j.disc.2020.112174

zbMATH Keywords

random graphedge-colored graphsupereulerian graphcompatible spanning circuitfan-type degree condition

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles ⋮ Compatible spanning circuits and forbidden induced subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New sufficient conditions for cycles in graphs
• Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs
• Graphs with cycles having adjacent lines different colors
• Alternating Hamiltonian cycles
• A property of the colored complete graph
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Connectivity and edge-disjoint spanning trees
• Graphs with Hamiltonian cycles having adjacent lines different colours
• Compatible spanning circuits in edge-colored graphs
• Spanning trees and spanning Eulerian subgraphs with small degrees
• A note on graphs spanned by Eulerian graphs
• Disjoint Hamilton cycles in the random geometric graph
• Random Plane Networks
• Supereulerian graphs: A survey
• Disjoint Hamiltonian cycles in fan 2k‐type graphs
• The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
• Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results

This page was built for publication: Almost Eulerian compatible spanning circuits in edge-colored graphs