On the theory of graphs
P. Turán (1954)
Colloquium Mathematicae
Similarity:
P. Turán (1954)
Colloquium Mathematicae
Similarity:
H. V. Kronk, D. R. Lick (1970)
Colloquium Mathematicae
Similarity:
A. Hajnal (1985)
Publications du Département de mathématiques (Lyon)
Similarity:
Robert Janczewski, Michał Małafiejski, Anna Małafiejska (2018)
Discussiones Mathematicae Graph Theory
Similarity:
Donald J. Miller (1970)
Colloquium Mathematicae
Similarity:
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
Halina Bielak (1998)
Discussiones Mathematicae Graph Theory
Similarity:
In this note, all chromatic equivalence classes for 2-connected 3-chromatic graphs with five triangles and cyclomatic number six are described. New families of chromatically unique graphs of order n are presented for each n ≥ 8. This is a generalization of a result stated in [5]. Moreover, a proof for the conjecture posed in [5] is given.
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity:
Jan Kisyński (1990)
Annales Polonici Mathematici
Similarity:
Mieczysław Borowiecki, Anna Fiedorowicz (2006)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper a concept 𝓠-Ramsey Class of graphs is introduced, where 𝓠 is a class of bipartite graphs. It is a generalization of well-known concept of Ramsey Class of graphs. Some 𝓠-Ramsey Classes of graphs are presented (Theorem 1 and 2). We proved that 𝓣₂, the class of all outerplanar graphs, is not 𝓓₁-Ramsey Class (Theorem 3). This results leads us to the concept of acyclic reducible bounds for a hereditary property 𝓟 . For 𝓣₂ we found two bounds (Theorem 4). An improvement,...