Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems

DOI10.1016/j.disc.2018.04.014zbMath1387.05139OpenAlexW2800363555MaRDI QIDQ1752690

Zhi-Wei Guo, Chuan-Dong Xu, Sheng Gui Zhang, Xue Liang Li

Publication date: 24 May 2018

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

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

zbMATH Keywords

Eulerian digraphcompatible Eulerian circuitweakly generalized transition system

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Compatible spanning circuits and forbidden induced subgraphs ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compatible Euler tours for transition systems in Eulerian graphs
• Compatible Hamilton cycles in Dirac graphs
• Eulerian graphs and related topics. Part 1, Volume 1
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Hamiltonicity of digraphs for universal cycles of permutations
• On Hamiltonian bipartite graphs
• Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
• Note on Hamilton Circuits
• On the maximum number of pairwise compatible euler cycles
• Cycles containing matchings and pairwise compatible euler tours
• Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs
• Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
• Sufficient Conditions for Circuits in Graphs^†
• Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results

This page was built for publication: Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems