Counting set covers and split graphs.
Royle, Gordon F. (2000)
Journal of Integer Sequences [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The join of graphs and the binding minimality”
Counting set covers and split graphs.
Treewidth and minimum fill-in on -trapezoid graphs.
Bodlaender, Hans L., Kloks, Ton, Kratsch, Dieter, Müller, Haiko (1998)
Journal of Graph Algorithms and Applications
Similarity:
Graphs with maximum and minimum independence numbers.
Gutman, Ivan (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
A remark on distances in products of graphs
Vladimír Puš (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Generalized line graphs with the second largest eigenvalue at most 1.
Petrović, Miroslav, Milekić, Bojana (2000)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
On -closed graphs
Pavel Tomasta, Eliška Tomová (1988)
Czechoslovak Mathematical Journal
Similarity: