Multigraphic degree sequences and Hamiltonian-connected line graphs
From MaRDI portal
Publication:2240663
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)
Recommendations
Cites work
- Eulerian subgraphs and Hamilton-connected line graphs
- Graph theory
- 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
- 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
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)