Compatible spanning circuits in edge-colored graphs

DOI10.1016/J.DISC.2020.111908MaRDI QIDQ2182217zbMATH OpenOpenAlexFDO

Authors Zhiwei Guo, Binlong Li, Xueliang Li, Shenggui Zhang

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

compatible spanning circuitedge-colored graphore-type degree conditionspanning Eulerian subgraphsupereulerian graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Almost Eulerian compatible spanning circuits in edge-colored graphs
• Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
• Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
• Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
• Hamilton circuits with many colours in properly edge-coloured complete graphs.

Cites work

• A note on graphs spanned by Eulerian graphs
• A property of the colored complete graph
• Alternating Hamiltonian cycles
• Chinese postman problem on edge-colored multigraphs
• Digraphs
• Graph theory
• Graphs with cycles having adjacent lines different colors
• Graphs with Hamiltonian cycles having adjacent lines different colours
• scientific article; zbMATH DE number 1067836 (Why is no real title available?)
• scientific article; zbMATH DE number 1557065 (Why is no real title available?)
• scientific article; zbMATH DE number 3249675 (Why is no real title available?)
• New sufficient conditions for cycles in graphs
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• Properly colored paths and cycles
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Supereulerian graphs: A survey
• The orderly colored longest path problem -- a survey of applications and new algorithms

Cited in

(8)

• 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
• Compatible spanning circuits and forbidden induced subgraphs
• Trails in arc-colored digraphs avoiding forbidden transitions
• Euler dynamic H -trails in edge-colored graphs
• Dynamic cycles in edge-colored multigraphs
• Some algorithmic results for finding compatible spanning circuits in edge-colored graphs

This page was built for publication: Compatible spanning circuits in edge-colored graphs

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