A characterization for a sequence to be potentially \K_r+1-E(P₂),K_r+1^-2\-graphic

MaRDI QIDQ2839671zbMATH OpenFDO

Authors Ye Wang, Jian-Hua Yin

Publication date 12 July 2013

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

degree sequencepotentially \(\{K_{r+1}-E(P_2),K_{r+1}^{-2}\}\)-graphic sequence

Mathematics Subject Classification ID

Vertex degrees (05C07)

Recommendations

• A characterization for a sequence to be potentially \({K_{r+1}-e}\)-graphic
• On a characterization for a graphic sequence to be potentially \(K_{r+1}-E(G)\)-graphic.
• A note on the characterization of potentially \(K_{r+1}-P_k\)-graphic sequences
• Characterizing \(K_{r+1}-C_k\)-graphic sequences.
• A characterization for a graphic sequence to be potentially \(K_{2,s}\)-graphic

Cited in

(9)

• Potentially 2-connected integer pair sequences
• On a problem of potentially pancyclic-graphic sequences due to S.B. Rao
• A characterization for a sequence to be potentially \({K_{r+1}-e}\)-graphic
• A Rao-type characterization for a sequence to have a realization containing an arbitrary subgraph H
• On a characterization for a graphic sequence to be potentially \(K_{r+1}-E(G)\)-graphic.
• Characterizing \(K_{r+1}-C_k\)-graphic sequences.
• Potentially pK₂-graphic sequences
• Characterizing potentially \(A_{r+1}-mK_2\)-graphic sequences
• A note on the characterization of potentially \(K_{r+1}-P_k\)-graphic sequences

This page was built for publication: A characterization for a sequence to be potentially \(\{K_{r+1}-E(P_2),K_{r+1}^{-2}\}\)-graphic

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