Complete and almost complete minors in double-critical 8-chromatic graphs.
Pedersen, Anders Sune (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Graph minors and minimum degree.”
Complete and almost complete minors in double-critical 8-chromatic graphs.
The complexity of obtaining a distance-balanced graph.
Cabello, Sergio, Lukšič, Primož (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Anti-Ramsey numbers of spanning double stars.
Montágh, Balázs (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Sharp bounds for the sum of the squares of the degrees of a graph
Kinkar Ch. Das (2003)
Kragujevac Journal of Mathematics
Similarity:
On the upper bounds for the first Zagreb index
Aleksandar Ilić, Milovan Ilić, Bolian Liu (2011)
Kragujevac Journal of Mathematics
Similarity:
On the -Splitting Graph of a Graph
N. R. Santhi Maheswari, C. Sekar (2012)
Kragujevac Journal of Mathematics
Similarity:
Tetracyclic harmonic graphs
B. Borovićanin, I. Gutman, M. Petrović (2002)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Graph connectivity and Wiener index
I. Gutman, S. Zhang (2006)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
On the spectral radius of bicyclic graphs
M. Petrović, I. Gutman, Shu-Guang Guo (2005)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Signed total distance -domatic numbers of graphs
S. M. Sheikholeslami, L. Volkmann (2013)
Matematički Vesnik
Similarity:
Note on seed graphs with components of given order.
Fronček, D. (2000)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Toughness of -minor-free graphs.
Chen, Guantao, Egawa, Yoshimi, Kawarabayashi, Ken-ichi, Mohar, Bojan, Ota, Katsuhiro (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: