Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees

DOI10.1016/J.AML.2011.12.016MaRDI QIDQ452949zbMATH OpenOpenAlexFDO

Authors Xiaofeng Gu, Hong-Jian Lai, Yanting Liang

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

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

Recommendations

• Degree sequences and graphs with disjoint spanning trees
• Degree sequence and supereulerian graphs
• Degree sequence realizations with given packing and covering of spanning trees
• A remark on degree sequences of multigraphs
• Multigraphic degree sequences and Hamiltonian-connected line graphs

Cites work

• Degree sequence and supereulerian graphs
• Degree sequences and graphs with disjoint spanning trees
• Graph theory
• Line removal algorithms for graphs and their degree lists
• 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

(7)

• Degree sequences and graphs with disjoint spanning trees
• Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
• Multigraphic degree sequences and Hamiltonian-connected line graphs
• Degree sequence and supereulerian graphs
• Orientations and detachments of graphs with prescribed degrees and connectivity
• Edge disjoint caterpillar realizations
• Degree sequence realizations with given packing and covering of spanning trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452949)