Degree sequences of -free graphs.
Pikhurko, Oleg, Taraz, Anusch (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The sum of degrees in cliques.”
Degree sequences of -free graphs.
Upper and lower bounds for .
Xu, Xiaodong, Luo, Haipeng, Shao, Zehui (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bipartite diametrical graphs of diameter 4 and extreme orders.
Al-Addasi, Salah, Al-Ezeh, Hasan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On a problem of linear arboricity
Filip Guldan (1987)
Časopis pro pěstování matematiky
Similarity:
A small trivalent graph of girth 14.
Exoo, Geoffrey (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dense -free graphs are almost -partite.
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The min-max supergraph
Gary Chartrand, Ronald J. Gould, S. F. Kapoor (1980)
Mathematica Slovaca
Similarity:
On the Extension of Graphs with a Given Diameter without Superfluous Edges
Ferdinand Gliviak, Peter Kyš, Ján Plesník (1969)
Matematický časopis
Similarity:
Homomorphisms of complete n-partite graphs.
Girse, Robert D. (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity: