A characterization for a graphic sequence to be potentially K₁^3, 4-graphic

MaRDI QIDQ4604147zbMATHFDO

Authors

Publication date 23 February 2018

zbMATH Keywords

degree sequencepotentially \(K_{1^3, 4}\)-graphic

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Recommendations

• On the characterization of potentially \(K_{1,1,s}\)-graphic sequences
• On potentially \(K_{2,2,1,1}\)-graph graphic sequences
• scientific article; zbMATH DE number 2192193
• A condition that yields potentially \(K_{1^3, s}\)-graphic sequences
• A condition that yields potentially \(K_{1^4, s}\)-graphic sequences

Cited in

(7)

• scientific article; zbMATH DE number 2192193 (Why is no real title available?)
• The characterization for a graphic sequence to have a realization containing \(K _{1,1,s }\)
• On the characterization of potentially \(K_{1,1,s}\)-graphic sequences
• A condition that yields potentially \(K_{1^4, s}\)-graphic sequences
• A condition that yields potentially \(K_{1^3, s}\)-graphic sequences
• scientific article; zbMATH DE number 1910717 (Why is no real title available?)
• On potentially \(K_{2,2,1,1}\)-graph graphic sequences

This page was built for publication: A characterization for a graphic sequence to be potentially \(K_{1^3, 4}\)-graphic

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