Graph equations for line graphs and n-th distance graphs.
Simic, Slobodan K. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Displaying similar documents to “Independence number of 2-factor-plus-triangles graphs.”
Graph equations for line graphs and n-th distance graphs.
On the chromatic uniqueness of edge-gluing of complete tripartite graphs and cycles.
Chia, Gek Ling, Ho, Chee-Kit (2003)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Constructive upper bounds for cycle-saturated graphs of minimum size.
Gould, Ronald, Łuczak, Tomasz, Schmitt, John (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the recognition of bipolarizable and -simplicial graphs.
Nikolopoulos, Stavros D., Palios, Leonidas (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Fruit salad.
Gyárfás, András (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Independence number and disjoint theta graphs.
Fujita, Shinya, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Embedding graphs in their complements
Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Seymour Schuster (1981)
Czechoslovak Mathematical Journal
Similarity:
Characterization of semientire graphs with crossing number 2
D. G. Akka, J. K. Bano (2002)
Mathematica Bohemica
Similarity:
The purpose of this paper is to give characterizations of graphs whose vertex-semientire graphs and edge-semientire graphs have crossing number 2. In addition, we establish necessary and sufficient conditions in terms of forbidden subgraphs for vertex-semientire graphs and edge-semientire graphs to have crossing number 2.
Laplacian integral graphs with maximum degree 3.
Kirkland, Steve (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: