A note on potentially K₄-e graphical sequences

MaRDI QIDQ2760432zbMATH OpenFDO

Authors Chunhui Lai

Publication date 2 January 2002

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0308105

zbMATH Keywords

degree sequencegraphical sequencepotentially \(H\)-graphical

Mathematics Subject Classification ID

Vertex degrees (05C07)

Recommendations

• scientific article; zbMATH DE number 1910717
• scientific article; zbMATH DE number 2104715
• On the potential number of \(K_{r+1}-E(H)\)
• A characterization on potentially K₄+P₂-graphic sequences
• scientific article; zbMATH DE number 1931321

Cited in

(9)

• Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices
• scientific article; zbMATH DE number 1910717 (Why is no real title available?)
• The characterization for a graphic sequence to have a realization containing \(K _{1,1,s }\)
• scientific article; zbMATH DE number 1931321 (Why is no real title available?)
• Potentially K m — G-graphical sequences: A survey
• An Erdős-Stone Type Conjecture for Graphic Sequences
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
• On potentially \((K_5-H)\)-graphic sequences.
• On potentially \(K_{r+1}-U\)-graphical sequences

This page was built for publication: A note on potentially \(K_4-e\) graphical sequences

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