Multigraphic degree sequences and Hamiltonian-connected line graphs
DOI10.1007/S10255-021-1044-6zbMATH Open1477.05100OpenAlexW3206349829WikidataQ114228095 ScholiaQ114228095MaRDI QIDQ2240663FDOQ2240663
Authors: Ren-sen Ma, Ke-ke Wang, Hong-Jian Lai, Ai-Mei Yu
Publication date: 4 November 2021
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-021-1044-6
Recommendations
line graphHamiltonian-connected graphsmultigraphic degree sequencestrongly spanning trailable graphs
Graph theory (including graph drawing) in computer science (68R10) Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76) Network design and communication in computer systems (68M10)
Cites Work
- Graph theory
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Eulerian subgraphs and Hamilton-connected line graphs
- Hamiltonian connectedness in 3-connected line graphs
- Line removal algorithms for graphs and their degree lists
- Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
Cited In (4)
This page was built for publication: Multigraphic degree sequences and Hamiltonian-connected line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2240663)