Circuit decompositions and shortest circuit coverings of hypergraphs
From MaRDI portal
Publication:1743689
DOI10.1007/s00373-018-1881-0zbMath1392.05084OpenAlexW2792037882MaRDI QIDQ1743689
Weihua Lu, Cun-Quan Zhang, Dong Ye, Ye-Zhou Wu, Li-ying Kang
Publication date: 13 April 2018
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-018-1881-0
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Triple systems (05B07) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On tours that contain all edges of a hypergraph
- Shortest coverings of graphs with cycles
- Short circuit covers for regular matroids with a nowhere zero 5-flow
- Flows and generalized coloring theorems in graphs
- Integer flows and cycle covers
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
- Fulkerson's conjecture and circuit covers
- Proofs of two minimum circuit cover conjectures
- Quasi-Eulerian hypergraphs
- Short cycle covers of graphs and nowhere-zero flows
- Circular flows of nearly Eulerian graphs and vertex-splitting
- Circuit Covers of Signed Graphs
- Covering Multigraphs by Simple Circuits
- Regular factors of regular graphs
- Covering Graphs by Cycles
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Short cycle covers of cubic graphs
- Polyhedral decompositions of cubic graphs
