Barycentric Ramsey numbers for small graphs.
González, Samuel, González, Leida, Ordaz, Oscar (2009)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
González, Samuel, González, Leida, Ordaz, Oscar (2009)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Haynes, Gerald, Park, Catherine, Schaeffer, Amanda, Webster, Jordan, Mitchell, Lon H. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Montágh, Balázs (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Bentz, Cedric, Costa, Marie-Christine, Picouleau, Christophe, Ries, Bernard, De Werra, Dominique (2009)
Journal of Graph Algorithms and Applications
Similarity:
Ordaz, Oscar, Quiroz, Domingo (2007)
Divulgaciones Matemáticas
Similarity:
Li, Jinbo, Liu, Guizhen (2011)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Gerard Jennhwa Chang, Mickael Montassier, Arnaud Pêche, André Raspaud (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Let Δ ≥ 4 be an integer. In this note, we prove that every planar graph with maximum degree Δ and girth at least 1 Δ+46 is strong (2Δ−1)-edgecolorable, that is best possible (in terms of number of colors) as soon as G contains two adjacent vertices of degree Δ. This improves [6] when Δ ≥ 6.
Hofmeister, M. (1992)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Hüffner, Falk (2009)
Journal of Graph Algorithms and Applications
Similarity:
di Prisco, Carlos Augusto (2006)
Boletín de la Asociación Matemática Venezolana
Similarity:
Pedersen, Anders Sune (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Richter, R. Bruce, Rooney, Brendan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Przybyło, Jakub, Woźniak, Mariusz (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: