Potentially K m — G-graphical sequences: A survey

DOI10.1007/s10587-009-0074-7zbMath1224.05105arXiv0804.4226OpenAlexW2049395961MaRDI QIDQ3070180

Chunhui Lai, Lili Hu

Publication date: 2 February 2011

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

graphdegree sequencepotentially \(K_{m}-G\)-graphic sequence

Mathematics Subject Classification ID

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

Related Items (4)

A Rao-type characterization for a sequence to have a realization containing an arbitrary subgraph \(H\) ⋮ A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially S r,s -graphic ⋮ Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices ⋮ Graphic sequences and split graphs

Cites Work

• A variation of an extremal theorem due to Woodall
• Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences
• Graphic sequences with a realization containing a union of cliques
• Graphic sequences with a realization containing a generalized friendship graph
• Graphic sequences with a realization containing a complete multipartite subgraph
• The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
• On the potentially \(P_k\)-graphic sequences
• The smallest degree sum that yields potentially \(_{k}C_{\ell}\)-graphic sequences
• An extremal problem on potentially \(K_{r,s}\)-graphic sequences
• A variation of a classical Turán-type extremal problem
• An extremal problem on the potentially \(P_k\)-graphic sequences
• The smallest degree sum that yields potentially \(K_{r+1}-K_3\)-graphic sequences
• The topology of Julia sets for polynomials
• The threshold for the Erdős, Jacobson and Lehel conjecture to be true
• Algorithms for constructing graphs and digraphs with given valences and factors
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
• On potentially K 5-H-graphic sequences
• An Erdős-Stone Type Conjecture for Graphic Sequences
• Potentially H-bigraphic sequences
• On Potentially 3-regular graph graphic Sequences
• On potentially $K_{r+1}-U$-graphical Sequences
• Graphic sequences of trees and a problem of Frobenius
• On potentially H-graphic sequences
• Graphic sequences that have a realization with large clique number
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Potentially K m — G-graphical sequences: A survey