A characterization of box-bounded degree sequences of graphs

DOI10.1007/s00373-018-1897-5zbMath1395.05040OpenAlexW2805829202MaRDI QIDQ2413625

Mao-cheng Cai, Li-ying Kang

Publication date: 14 September 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1897-5

zbMATH Keywords

degree sequenceforcible versionNiessen's problem

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (1)

Solution to a forcible version of a graphic sequence problem

Cites Work

• A characterization of graphs having all \((g,f)\)-factors
• Solution to a problem on degree sequences of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of box-bounded degree sequences of graphs