A characterization for a graphic sequence to be potentially C_r-graphic

DOI10.1007/S11425-010-3124-6MaRDI QIDQ625906zbMATH OpenOpenAlexFDO

Authors Jian-Hua Yin

Publication date 25 February 2011

Published in Science China. Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11425-010-3124-6

zbMATH Keywords

graphcycledegree sequence

Mathematics Subject Classification ID

Vertex degrees (05C07) Paths and cycles (05C38)

Recommendations

• Degree sequences of graphs containing a cycle with prescribed length
• scientific article; zbMATH DE number 2188455
• A characterization for a graphic sequence to have a realization containinga a desired cycle
• Characterizing \(K_{r+1}-C_k\)-graphic sequences.
• On potentially \(C_{2,6}\)-graphic sequences.

Cites work

• scientific article; zbMATH DE number 1286471 (Why is no real title available?)
• scientific article; zbMATH DE number 867707 (Why is no real title available?)
• scientific article; zbMATH DE number 2192182 (Why is no real title available?)
• A variation of a classical Turán-type extremal problem
• Algorithms for constructing graphs and digraphs with given valences and factors
• An extremal problem on potentially \(K_{r,s}\)-graphic sequences
• An extremal problem on the potentially \(P_k\)-graphic sequences
• The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
• The k-factor conjecture is true
• The threshold for the Erdős, Jacobson and Lehel conjecture to be true
• The topology of Julia sets for polynomials
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size

Cited in

(7)

• Degree sequences of graphs containing a cycle with prescribed length
• A characterization for a graphic sequence to have a realization containinga a desired cycle
• scientific article; zbMATH DE number 2188455 (Why is no real title available?)
• On factorable bigraphic pairs
• On a problem of potentially pancyclic-graphic sequences due to S.B. Rao
• A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially S r,s -graphic
• Graphic sequences with a realization containing cycles \(C_3, \dots, C_\ell \)

This page was built for publication: A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic

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