A Note On Graphs Representable As Product Graphs
Zlatomir Lukić (1982)
Publications de l'Institut Mathématique
Similarity:
Zlatomir Lukić (1982)
Publications de l'Institut Mathématique
Similarity:
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity:
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
Igor' E. Zverovich, Olga I. Zverovich (2004)
Discussiones Mathematicae Graph Theory
Similarity:
We introduce a new hereditary class of graphs, the dominant-matching graphs, and we characterize it in terms of forbidden induced subgraphs.
Lynch, Christopher, Strogova Polina (1998)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
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.
Grady D. Bullington, Linda L. Eroh, Steven J. Winters (2010)
Discussiones Mathematicae Graph Theory
Similarity:
Explicit formulae for the γ-min and γ-max labeling values of complete bipartite graphs are given, along with γ-labelings which achieve these extremes. A recursive formula for the γ-min labeling value of any complete multipartite is also presented.
Robert Janczewski, Michał Małafiejski, Anna Małafiejska (2018)
Discussiones Mathematicae Graph Theory
Similarity: