A note on odd cycle-complete graph Ramsey numbers.
Sudakov, Benny (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Improved bounds for the number of forests and acyclic orientations in the square lattice.”
A note on odd cycle-complete graph Ramsey numbers.
Subdeterminants and subgraphs
Antonín Vrba (1974)
Časopis pro pěstování matematiky
Similarity:
Kocay's lemma, Whitney's theorem, and some polynomial invariant reconstruction problems.
Thatte, Bhalchandra D. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graph compositions. I: Basic enumeration.
Knopfmacher, A., Mays, M.E. (2001)
Integers
Similarity:
Colorings and orientations of matrices and graphs.
Schauz, Uwe (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Laplacian permanental polynomial for trees
Russell Merris (1982)
Czechoslovak Mathematical Journal
Similarity:
Small forbidden configurations. II.
Anstee, Richard, Ferguson, Ron, Sali, Attila (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rank numbers for bent ladders
Peter Richter, Emily Leven, Anh Tran, Bryan Ek, Jobby Jacob, Darren A. Narayan (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A ranking on a graph is an assignment of positive integers to its vertices such that any path between two vertices with the same label contains a vertex with a larger label. The rank number of a graph is the fewest number of labels that can be used in a ranking. The rank number of a graph is known for many families, including the ladder graph P2 × Pn. We consider how ”bending” a ladder affects the rank number. We prove that in certain cases the rank number does not change, and in others...
Graphs with many copies of a given subgraph.
Nikiforov, Vladimir (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kasteleyn cokernels.
Kuperberg, Greg (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity: