The min-max supergraph
Gary Chartrand, Ronald J. Gould, S. F. Kapoor (1980)
Mathematica Slovaca
Similarity:
Displaying similar documents to “An extremal problem on potentially -graphic sequences.”
The min-max supergraph
Vertex-disjoint copies of K¯₄
Ken-ichi Kawarabayashi (2004)
Discussiones Mathematicae Graph Theory
Similarity:
Let G be a graph of order n. Let K¯ₗ be the graph obtained from Kₗ by removing one edge. In this paper, we propose the following conjecture: Let G be a graph of order n ≥ lk with δ(G) ≥ (n-k+1)(l-3)/(l-2)+k-1. Then G has k vertex-disjoint K¯ₗ. This conjecture is motivated by Hajnal and Szemerédi's [6] famous theorem. In this paper, we verify this conjecture for l=4.
Graphic and protographic lists of integers.
Fon-Der-Flaass, Dmitry, West, Douglas B. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The sum of degrees in cliques.
Bollobás, Béla, Nikiforov, Vladimir (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A Turán type problem concerning the powers of the degrees of a graph.
Caro, Yair, Yuster, Raphael (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Degree sequences of -free graphs.
Pikhurko, Oleg, Taraz, Anusch (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a problem of linear arboricity
Filip Guldan (1987)
Časopis pro pěstování matematiky
Similarity:
The Collatz problem and analogues.
Snapp, Bart, Tracy, Matt (2008)
Journal of Integer Sequences [electronic only]
Similarity:
Signed degree sets in signed graphs
Shariefuddin Pirzada, T. A. Naikoo, F. A. Dar (2007)
Czechoslovak Mathematical Journal
Similarity:
The set of distinct signed degrees of the vertices in a signed graph is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph. We also prove that every non-empty set of integers is the signed degree set of some connected signed graph.