Graphs with nonisomorphic vertex neighbourhoods of the first and second types
Zdeněk Ryjáček (1987)
Časopis pro pěstování matematiky
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.
Displaying similar documents to “On minimal words with given subword complexity.”
Graphs with nonisomorphic vertex neighbourhoods of the first and second types
The induced subgraph order on unlabelled graphs.
Sloss, Craig A. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Some properties of the singular words of the Fibonacci word.
Wen, Zhixiong, Wen, Zhi-Ying (1993)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Even kernels.
Fraenkel, Aviezri (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs.
Chen, Hon-Chan (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Maximal pentagonal packings.
Černý, A., Horák, P., Rosa, A., Znám, Š. (1996)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Maxmaxflow and counting subgraphs.
Jackson, Bill, Sokal, Alan D. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
One-two descriptor of graphs
K. CH. Das, I. Gutman, D. Vukičević (2011)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
A restricted random walk defined via a Fibonacci process.
Griffiths, Martin (2011)
Journal of Integer Sequences [electronic only]
Similarity: