Locally self-avoiding Eulerian tours

DOI10.1016/j.jctb.2018.08.008zbMath1404.05108arXiv1611.07486OpenAlexW2890992951MaRDI QIDQ5915927

Tien-Nam Le

Publication date: 8 February 2019

Published in: Electronic Notes in Discrete Mathematics, Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.07486

zbMATH Keywords

Eulerian graphspath-decompositionpath decompositionBarát-Thomassen conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Decomposing highly edge-connected graphs into paths of any given length
• Decomposing graphs into paths and trees
• Triangle-free Eulerian tours in graphs with maximum degree at most 4
• A proof of the Barát-Thomassen conjecture
• Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Claw‐decompositions and tutte‐orientations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Locally self-avoiding Eulerian tours