Edge neighbourhood graphs
Bohdan Zelinka (1986)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “Orthogonal art galleries with holes: a coloring proof of Aggarwal's theorem.”
Edge neighbourhood graphs
Independence number and disjoint theta graphs.
Fujita, Shinya, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graphs Which Are Switching Equivalent To Their Complementary Line Graphs II
Slobodan K. Simić (1982)
Publications de l'Institut Mathématique
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:
Maximal pentagonal packings.
Černý, A., Horák, P., Rosa, A., Znám, Š. (1996)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Blueprint for a classic proof of the 4 colour theorem
Patrick Labarque (2010)
Visual Mathematics
Similarity:
On the completeness-number of a finite graph. II.
Ivan Havel (1968)
Časopis pro pěstování matematiky
Similarity:
Tight upper bounds for the domination numbers of graphs with given order and minimum degree.
Clark, W.Edwin, Dunning, Larry A. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tiling tripartite graphs with 3-colorable graphs.
Martin, Ryan, Zhao, Yi (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: