Combinatorial labelings of graphs.
Hegde, Suresh Manjanath, Shetty, Sudhakar (2006)
Applied Mathematics E-Notes [electronic only]
Similarity:
Displaying similar documents to “Generalisations of the Tits representation.”
Combinatorial labelings of graphs.
The cube polynomial and its derivatives: The case of median graphs.
Brešar, Boštjan, Klavžar, Sandi, Škrekovski, Riste (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on randomly complete -partite graphs
Pavol Híc (1992)
Mathematica Slovaca
Similarity:
Graph powers and graph homomorphisms.
Hajiabolhassan, Hossein, Taherkhani, Ali (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dynamic cage survey.
Exoo, Geoffrey, Jajcay, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graph equations, graph inequalities and a fixed point theorem.
I.B. Lackovic, D.M. Cvetkovic (1976)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
A note on the graph equation .
Simić, Slobodan K. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
The remarkable generalized Petersen graph
Dragan Marušič, Tomaž Pisanski (2000)
Mathematica Slovaca
Similarity:
Universality in Graph Properties with Degree Restrictions
Izak Broere, Johannes Heidema, Peter Mihók (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Rado constructed a (simple) denumerable graph R with the positive integers as vertex set with the following edges: For given m and n with m < n, m is adjacent to n if n has a 1 in the m’th position of its binary expansion. It is well known that R is a universal graph in the set [...] of all countable graphs (since every graph in [...] is isomorphic to an induced subgraph of R). A brief overview of known universality results for some induced-hereditary subsets of [...] is provided....