The diameter of almost Eulerian digraphs.
Dankelmann, Peter, Volkmann, L. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Three-and-more set theorems”
The diameter of almost Eulerian digraphs.
The independence number of dense graphs with large odd girth.
Shearer, James B. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Frobenius number of Fibonacci numerical semigroups.
Marín, J.M., Ramírez Alfonsín, J.L., Revuelta, M.P. (2007)
Integers
Similarity:
An extension of the exponential formula in enumerative combinatorics.
Labelle, Gilbert, Leroux, Pierre (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Decomposition of a Digraph into Isotopic Subgraphs
Bohdan Zelinka (1971)
Matematický časopis
Similarity:
Alon-Babai-Suzuki's conjecture related to binary codes in nonmodular version.
Hwang, K.-W., Kim, T., Jang, L.C., Kim, P., Sohn, Gyoyong (2010)
Journal of Inequalities and Applications [electronic only]
Similarity:
Common periodic points for a class of continuous commuting mappings on an interval.
Kang, Shin Min, Wang, Weili (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Domain identification for semilinear elliptic equations in the plane: The zero flux case.
Trong, D.D., Ang, D.D. (2000)
Zeitschrift für Analysis und ihre Anwendungen
Similarity: