Zobrazeno 1 - 10
of 84
pro vyhledávání: '"Albertson, Michael"'
Publikováno v:
Electronic J. of Combinatorics, R45 16(1), 2009
Albertson conjectured that if graph $G$ has chromatic number $r$, then the crossing number of $G$ is at least that of the complete graph $K_r$. This conjecture in the case $r=5$ is equivalent to the four color theorem. It was verified for $r=6$ by Op
Externí odkaz:
http://arxiv.org/abs/1006.3783
We prove that if G is a triangulation of the torus and \chi(G) \neq 5, then there is a 3-coloring of the edges of G so that the edges bounding every face are assigned three different colors.
Comment: 17 pages, 8 figures, submitted for review for
Comment: 17 pages, 8 figures, submitted for review for
Externí odkaz:
http://arxiv.org/abs/0805.0394
Autor:
Albertson, Michael
Publikováno v:
Music Educators Journal, 2014 Sep 01. 101(1), 21-22.
Externí odkaz:
https://www.jstor.org/stable/43289085
Autor:
Albertson, Michael
Publikováno v:
Music Educators Journal, 2012 Sep 01. 99(1), 7-7.
Externí odkaz:
https://www.jstor.org/stable/41692678
Publikováno v:
In Discrete Mathematics 2010 310(20):2725-2734
Autor:
Albertson, Michael O.
Publikováno v:
Mathematics Magazine, 1994 Oct 01. 67(4), 278-281.
Externí odkaz:
https://www.jstor.org/stable/2690847
Publikováno v:
Transactions of the American Mathematical Society, 1977 Feb 01. 226, 161-173.
Externí odkaz:
https://www.jstor.org/stable/1997946
Publikováno v:
Proceedings of the American Mathematical Society, 1982 Mar 01. 84(3), 449-456.
Externí odkaz:
https://www.jstor.org/stable/2043580
Publikováno v:
Transactions of the American Mathematical Society, 1973 Jul 01. 181, 471-482.
Externí odkaz:
https://www.jstor.org/stable/1996646
Publikováno v:
In Journal of Combinatorial Theory, Series B 2006 96(4):472-481