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.
Stanisław Bylka (2005)
Discussiones Mathematicae Graph Theory
Similarity:
Families of all sets of independent vertices in graphs are investigated. The problem how to characterize those infinite graphs which have arithmetically maximal independent sets is posed. A positive answer is given to the following classes of infinite graphs: bipartite graphs, line graphs and graphs having locally infinite clique-cover of vertices. Some counter examples are presented.
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity:
Zlatomir Lukić (1982)
Publications de l'Institut Mathématique
Similarity:
Sergiy Kozerenko (2015)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
In his PhD thesis [Structural aspects of switching classes, Leiden Institute of Advanced Computer Science, 2001] Hage posed the following problem: “characterize the maximum size graphs in switching classes”. These are called s-maximal graphs. In this paper, we study the properties of such graphs. In particular, we show that any graph with sufficiently large minimum degree is s-maximal, we prove that join of two s-maximal graphs is also an s-maximal graph, we give complete characterization...