On Potentially (K5-C4)-graphic Sequences
Lili Hu, Chunhui Lai
math.COarXiv:math/0701023
Abstract
In this paper, we characterize the potentially (K5-C4)-graphic sequences where K5-C4 is the graph obtained from K5 by removing four edges of a 4 cycle C4. This characterization implies a theorem due to Lai [6].
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell