The crossing numbers of some generalized Petersen graphs.
F. Harary, G. Exoo, J. Kabell (1981)
Mathematica Scandinavica
Similarity:
F. Harary, G. Exoo, J. Kabell (1981)
Mathematica Scandinavica
Similarity:
Ivan Tafteberg Jakobsen (1983)
Mathematica Scandinavica
Similarity:
G.A. Dirac (1963)
Mathematica Scandinavica
Similarity:
Gabriel Dirac (1972)
Mathematica Scandinavica
Similarity:
Ivan Tafteberg Jakobsen (1972)
Mathematica Scandinavica
Similarity:
Tudor Zamfirescu (1976)
Mathematica Scandinavica
Similarity:
Masaki Izumi (1993)
Mathematica Scandinavica
Similarity:
Lars Dovling Andersen (1977)
Mathematica Scandinavica
Similarity:
R. Ayala, E. Dominguez, A. Márquez (1995)
Mathematica Scandinavica
Similarity:
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.
G. Koester (1990)
Mathematica Scandinavica
Similarity:
Zlatomir Lukić (1982)
Publications de l'Institut Mathématique
Similarity:
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity: