On minimal words with given subword complexity.
Wang, Ming-wei, Shallit, Jeffrey (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The induced subgraph order on unlabelled graphs.”
On minimal words with given subword complexity.
Distances between partially ordered sets
Bohdan Zelinka (1993)
Mathematica Bohemica
Similarity:
A distance between finite partially ordered sets is studied. It is a certain measure of the difference of their structure.
Unmixed bipartite graphs.
Villarreal, Rafael H. (2007)
Revista Colombiana de Matemáticas
Similarity:
The Ramsey numbers of large cycles versus small wheels.
Surahmat, Baskoro, E.T., Broersma, H.J. (2004)
Integers
Similarity:
Odd mean labeling of the graphs and
R. Vasuki, A. Nagarajan (2012)
Kragujevac Journal of Mathematics
Similarity:
More counterexamples to the Alon-Saks-Seymour and rank-coloring conjectures.
Cioabă, Sebastian M., Tait, Michael (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A Turán type problem concerning the powers of the degrees of a graph.
Caro, Yair, Yuster, Raphael (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-factorials of .
Sun, Yidong, Zhuang, Jujuan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The face labeling of maximal planar graphs.
Cahit, Ibrahim (2011)
Applied Mathematics E-Notes [electronic only]
Similarity:
Cyclic sieving phenomenon in non-crossing connected graphs.
Guo, Alan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Macaulay posets.
Bezrukov, Sergei L., Leck, Uwe (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity: