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:
Displaying similar documents to “Trivial Selmer groups and even partitions of a graph.”
More counterexamples to the Alon-Saks-Seymour and rank-coloring conjectures.
On the first eigenvalue of bipartite graphs.
Bhattacharya, Amitava, Friedland, Shmuel, Peled, Uri N. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Directed graphs and matrix equations
Juraj Bosák (1978)
Mathematica Slovaca
Similarity:
On the function “sandwiched" between and .
Dobrynin, V.Y. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The linear complexity of a graph.
Neel, David L., Orrison, Michael E. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Problems in algebraic combinatorics.
Godsil, C.D. (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Matrix partitions with finitely many obstructions.
Feder, Tomás, Hell, Pavol, Xie, Wing (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property.
Bonato, Anthony, Holzmann, W.H., Kharaghani, Hadi (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Random threshold graphs.
Reilly, Elizabeth Perez, Scheinerman, Edward R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graphic matrices
Zofia Majcher (1988)
Mathematica Slovaca
Similarity: