Spanning Euler tours in hypergraphs

DOI10.1016/J.JCTA.2026.106194MaRDI QIDQ7314607zbMATH OpenFDO

Authors M. A. Bahmanian, Songling Shan

Publication date 14 August 2026

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTA.2026.106194

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65)

Cites work

• -covering k-hypergraphs are quasi-Eulerian
• 1-overlap cycles for Steiner triple systems
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• A Survey of Combinatorial Gray Codes
• An algorithmic proof of Tutte's f-factor theorem
• An Eulerian path approach to DNA fragment assembly
• Connection and separation in hypergraphs
• Covering hypergraphs are Eulerian
• Cycle extensions in BIBD block-intersection graphs
• Cycle extensions in PBD block-intersection graphs.
• Cycles in the block-intersection graph of pairwise balanced designs
• Edge-pancyclic block-intersection graphs
• Euler tours in hypergraphs
• Hamilton cycles in restricted block-intersection graphs
• Hamiltonian chains in hypergraphs
• Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs
• Hamiltonicity and restricted block-intersection graphs of t-designs
• scientific article; zbMATH DE number 431053 (Why is no real title available?)
• scientific article; zbMATH DE number 4160773 (Why is no real title available?)
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• On tours that contain all edges of a hypergraph
• Optimal and pessimal orderings of Steiner triple systems in disk arrays.
• Ordering block designs. Gray codes, universal cycles and configuration orderings
• Overlap cycles for Steiner quadruple systems
• Pancyclic PBD block-intersection graphs
• Partitioning the edge set of a hypergraph into almost regular cycles
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Perfect matchings in uniform hypergraphs with large minimum degree
• Quasi-Eulerian hypergraphs
• Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts
• The factorization of graphs. II
• The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.
• Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
• Triple systems are Eulerian
• Universal cycles for combinatorial structures

This page was built for publication: Spanning Euler tours in hypergraphs

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