On the theory of graphs
P. Turán (1954)
Colloquium Mathematicae
Similarity:
Displaying similar documents to “Some remarks on chromatic graphs”
On the theory of graphs
On prescribed connectivities in graphs
H. V. Kronk, D. R. Lick (1970)
Colloquium Mathematicae
Similarity:
On Large Chromatic Graphs Not Containing Prescribed Subgraphs
A. Hajnal (1985)
Publications du Département de mathématiques (Lyon)
Similarity:
On Incidence Coloring of Complete Multipartite and Semicubic Bipartite Graphs
Robert Janczewski, Michał Małafiejski, Anna Małafiejska (2018)
Discussiones Mathematicae Graph Theory
Similarity:
Weak cartesian product of graphs
Donald J. Miller (1970)
Colloquium Mathematicae
Similarity:
A note on intersecting graphs.
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
'3in1' enhanced: three squared ways to '3in1' GRAPHS
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
Chord graphs - new means for representing graphs
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six
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.
A Generalized Direct Product Of Graphs
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
A technique for reconstructing disconnected graphs
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity:
Metrization of D_E[0,1] by Hausdorff distance between graphs
Jan Kisyński (1990)
Annales Polonici Mathematici
Similarity:
Some globally determined classes of graphs
Ivica Bošnjak, Rozália Madarász (2018)
Czechoslovak Mathematical Journal
Similarity:
For a class of graphs we say that it is globally determined if any two nonisomorphic graphs from that class have nonisomorphic globals. We will prove that the class of so called CCB graphs and the class of finite forests are globally determined.