A characterization of box-bounded degree sequences of graphs

DOI10.1007/S00373-018-1897-5MaRDI QIDQ2413625zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

degree sequenceforcible versionNiessen's problem

Mathematics Subject Classification ID

Vertex degrees (05C07)

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
• scientific article; zbMATH DE number 3997845
• scientific article; zbMATH DE number 5778323
• 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

Cites work

• A characterization of graphs having all (g,f)-factors
• A variant of Niessen's problem on degree sequences of graphs
• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• Solution to a problem on degree sequences of graphs

Cited in

(8)

• Solution to a problem on degree sequences of graphs
• Solution to a forcible version of a graphic sequence problem
• A characterization for (A_n;B_n) to be m-graphic
• scientific article; zbMATH DE number 4023339 (Why is no real title available?)
• Two short proofs of the bounded case of S. B. Rao's degree sequence conjecture
• Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps
• Constructive extensions of two results on graphic sequences
• A characterization of the degree sequence of the graph with cyclomatic number \(k\).

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)