A not on dominating set with Maple.
Matinfar, M., Mirzamani, S. (2008)
The Journal of Nonlinear Sciences and its Applications
Similarity:
Matinfar, M., Mirzamani, S. (2008)
The Journal of Nonlinear Sciences and its Applications
Similarity:
N. R. Santhi Maheswari, C. Sekar (2012)
Kragujevac Journal of Mathematics
Similarity:
Arenas, F.G., Puertas, M.L. (2000)
Divulgaciones Matemáticas
Similarity:
Iranmanesh, A., Jafarzadeh, A. (2007)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Bartłomiejczyk, L., Morawiec, J. (2004)
Mathematica Pannonica
Similarity:
Kinkar Ch. Das (2003)
Kragujevac Journal of Mathematics
Similarity:
Bandyopadhyay, Nandini, Bhattacharyya, P. (2005)
Bulletin of the Malaysian Mathematical Sciences Society. Second 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].
Harishchandra S. Ramane, Ivan Gutman, Hanumappa B. Walikar, Sabeena B. Halkarni (2004)
Kragujevac Journal of Mathematics
Similarity:
Milan Vítek (1986)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity: