A characterization of box-bounded degree sequences of graphs

DOI10.1007/S00373-018-1897-5zbMATH Open1395.05040OpenAlexW2805829202MaRDI QIDQ2413625FDOQ2413625

Authors: Mao-Cheng Cai, Liying 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

Recommendations

• Boxicity of graphs with bounded degree
• Characterization of the graphs with boxicity \(\leq 2\)
• New bounds for degree sequence of graphs
• Boxicity of series-parallel graphs
• Bounds for the boxicity of Mycielski graphs
• Publication:4724665
• scientific article
• Sur la dimension de boîte des graphes
• An extremal problem on degree sequences of graphs
• Constructing bounded degree graphs with prescribed degree and neighbor degree sequences

zbMATH Keywords

degree sequenceforcible versionNiessen's problem

Mathematics Subject Classification ID

Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• Solution to a problem on degree sequences of graphs
• A characterization of graphs having all \((g,f)\)-factors
• Title not available (Why is that?)

Cited In (2)

• Solution to a forcible version of a graphic sequence problem
• Title not available (Why is that?)

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

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