Complete and almost complete minors in double-critical 8-chromatic graphs.
Pedersen, Anders Sune (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Pedersen, Anders Sune (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fronček, D. (2000)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Liu Wu-xin, Wei Fu-yi (2011)
Kragujevac Journal of Mathematics
Similarity:
N. R. Santhi Maheswari, C. Sekar (2012)
Kragujevac Journal of Mathematics
Similarity:
Singaraj K. Ayyaswamy, Selvaraj Balachandran, Ivan Gutman (2010)
Kragujevac Journal of Mathematics
Similarity:
Sudhir R. Jog, Satish P. Hande, Ivan Gutman, S. Burcu Bozkurt (2012)
Kragujevac Journal of Mathematics
Similarity:
Kishori P. Narayankar, S. B. Lokesh, Veena Mathad, Ivan Gutman (2012)
Kragujevac Journal of Mathematics
Similarity:
Kinkar Ch. Das (2003)
Kragujevac Journal of Mathematics
Similarity:
Cvetković, D., Lepović, M. (2004)
Bulletin. Classe des Sciences Mathématiques et Naturelles. Sciences Mathématiques
Similarity:
Cabello, Sergio, Lukšič, Primož (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Christophe Pittet (1998)
Colloquium Mathematicae
Similarity:
Let X be a connected graph with uniformly bounded degree. We show that if there is a radius r such that, by removing from X any ball of radius r, we get at least three unbounded connected components, then X satisfies a strong isoperimetric inequality. In particular, the non-reduced -cohomology of X coincides with the reduced -cohomology of X and is of uncountable dimension. (Those facts are well known when X is the Cayley graph of a finitely generated group with infinitely many ends.) ...
M. Petrović, I. Gutman, Shu-Guang Guo (2005)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity: