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 “Anti-Ramsey numbers of spanning double stars.”
Complete and almost complete minors in double-critical 8-chromatic graphs.
Degree-constrained edge partitioning in graphs arising from discrete tomography.
Bentz, Cedric, Costa, Marie-Christine, Picouleau, Christophe, Ries, Bernard, De Werra, Dominique (2009)
Journal of Graph Algorithms and Applications
Similarity:
Graph minors and minimum degree.
Fijavž, Gašper, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The complexity of obtaining a distance-balanced graph.
Cabello, Sergio, Lukšič, Primož (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Orthogonal vector coloring.
Haynes, Gerald, Park, Catherine, Schaeffer, Amanda, Webster, Jordan, Mitchell, Lon H. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Total weight choosability of graphs.
Przybyło, Jakub, Woźniak, Mariusz (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on -colorings of graphs.
Sheng, Jian-Ting, Liu, Gui-Zhen (2011)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
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:
Sharp bounds for the sum of the squares of the degrees of a graph
Kinkar Ch. Das (2003)
Kragujevac Journal of Mathematics
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:
Deciding soccer scores and partial orientations of graphs.
Pálvölgyi, Dömötör (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Strong Chromatic Index Of Planar Graphs With Large Girth
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.
On the upper bounds for the first Zagreb index
Aleksandar Ilić, Milovan Ilić, Bolian Liu (2011)
Kragujevac Journal of Mathematics
Similarity: