Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees

DOI10.1016/j.aml.2011.12.016zbMath1248.05174OpenAlexW2017973453MaRDI QIDQ452949

Yanting Liang, Xiaofeng Gu, Hong-Jian Lai

Publication date: 18 September 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.12.016

zbMATH Keywords

edge-disjoint spanning treesHamiltonian line graphsmultigraphic degree sequencesupereulerian graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees ⋮ Multigraphic degree sequences and Hamiltonian-connected line graphs ⋮ Orientations and detachments of graphs with prescribed degrees and connectivity

Cites Work

• Unnamed Item
• Degree sequences and graphs with disjoint spanning trees
• Degree sequence and supereulerian graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Line removal algorithms for graphs and their degree lists
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees