On the -Splitting Graph of a Graph
N. R. Santhi Maheswari, C. Sekar (2012)
Kragujevac Journal of Mathematics
Similarity:
N. R. Santhi Maheswari, C. Sekar (2012)
Kragujevac Journal of Mathematics
Similarity:
Pedersen, Anders Sune (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Matinfar, M., Mirzamani, S. (2008)
The Journal of Nonlinear Sciences and its Applications
Similarity:
Kinkar Ch. Das (2003)
Kragujevac Journal of Mathematics
Similarity:
Chen, Guantao, Egawa, Yoshimi, Kawarabayashi, Ken-ichi, Mohar, Bojan, Ota, Katsuhiro (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Saoud, Mahmoud, Al-Khanaifes, Kaled (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Arenas, F.G., Puertas, M.L. (2000)
Divulgaciones Matemáticas
Similarity:
Hetyei, Gábor (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Harishchandra S. Ramane, Ivan Gutman, Hanumappa B. Walikar, Sabeena B. Halkarni (2004)
Kragujevac Journal of Mathematics
Similarity:
Fijavž, Gašper, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sudhir R. Jog, Satish P. Hande, Ivan Gutman, S. Burcu Bozkurt (2012)
Kragujevac Journal of Mathematics
Similarity:
Stacho, L. (2002)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Piotr Rudnicki, Lorna Stewart (2012)
Formalized Mathematics
Similarity:
Harary [10, p. 7] claims that Veblen [20, p. 2] first suggested to formalize simple graphs using simplicial complexes. We have developed basic terminology for simple graphs as at most 1-dimensional complexes. We formalize this new setting and then reprove Mycielski’s [12] construction resulting in a triangle-free graph with arbitrarily large chromatic number. A different formalization of similar material is in [15].
S. M. Sheikholeslami, L. Volkmann (2013)
Matematički Vesnik
Similarity: