Star Complements and Maximal Exceptional Graphs
P. Rowlinson (2004)
Publications de l'Institut Mathématique
Similarity:
P. Rowlinson (2004)
Publications de l'Institut Mathématique
Similarity:
J. J. Seidel (1989)
Banach Center Publications
Similarity:
Bojana Borovićanin (2002)
Publications de l'Institut Mathématique
Similarity:
Dragoš Cvetković (1982)
Publications de l'Institut Mathématique
Similarity:
Jan Kratochvíl, Peter Mihók, Gabriel Semanišin (1997)
Discussiones Mathematicae Graph Theory
Similarity:
For a simple graph H, →H denotes the class of all graphs that admit homomorphisms to H (such classes of graphs are called hom-properties). We investigate hom-properties from the point of view of the lattice of hereditary properties. In particular, we are interested in characterization of maximal graphs belonging to →H. We also provide a description of graphs maximal with respect to reducible hom-properties and determine the maximum number of edges of graphs belonging to →H.
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...