On hamiltonian line graphs of hypergraphs

DOI10.1002/jgt.22791zbMath1522.05345OpenAlexW4205570092WikidataQ114236141 ScholiaQ114236141MaRDI QIDQ6081552

Hong-Jian Lai, Sulin Song, Xiaofeng Gu

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22791

zbMATH Keywords

hypertreeHamiltonian line graphEulerian hypergraphpartition-connected hypergraphsupereulerian hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Augmenting and preserving partition connectivity of a hypergraph
• On a closure concept in claw-free graphs
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• Thomassen's conjecture for line graphs of 3-hypergraphs
• Hamiltonian results inK1,3-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• A Note on Sub-Eulerian Graphs
• Reflections on graph theory
• Hamiltonicity for K_{1, r}‐free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: On hamiltonian line graphs of hypergraphs