Partition numbers, connectivity and Hamiltonicity
Mieczysław Borowiecki (1987)
Časopis pro pěstování matematiky
Similarity:
Mieczysław Borowiecki (1987)
Časopis pro pěstování matematiky
Similarity:
Teresa Haynes, Michael Henning (2012)
Open Mathematics
Similarity:
A graph G is diameter-2-critical if its diameter is two and the deletion of any edge increases the diameter. In this paper we characterize the diameter-2-critical graphs with no antihole of length four, that is, the diameter-2-critical graphs whose complements have no induced 4-cycle. Murty and Simon conjectured that the number of edges in a diameter-2-critical graph of order n is at most n 2/4 and that the extremal graphs are complete bipartite graphs with equal size partite sets. As...
Bohdan Zelinka (1984)
Mathematica Slovaca
Similarity:
Josef Voldřich (1978)
Časopis pro pěstování matematiky
Similarity:
Tomoki Nakamigawa (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Let k and ℓ be positive integers with ℓ ≤ k − 2. It is proved that there exists a positive integer c depending on k and ℓ such that every graph of order (2k−1−ℓ/k)n+c contains n vertex disjoint induced subgraphs, where these subgraphs are isomorphic to each other and they are isomorphic to one of four graphs: (1) a clique of order k, (2) an independent set of order k, (3) the join of a clique of order ℓ and an independent set of order k − ℓ, or (4) the union of an independent set of...
Gutman, Ivan (1989)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: