default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael O. Albertson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j39]Michael O. Albertson, János Pach, Michael E. Young:
Disjoint homometric sets in graphs. Ars Math. Contemp. 4(1): 1-4 (2011)- [j38]Michael O. Albertson, Debra L. Boutin, Ellen Gethner:
More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number. Ars Math. Contemp. 4(1): 5-24 (2011) - 2010
- [j37]Michael O. Albertson, Debra L. Boutin, Ellen Gethner:
The thickness and chromatic number of r-inflated graphs. Discret. Math. 310(20): 2725-2734 (2010) - [j36]Michael O. Albertson, Hannah Alpert
, sarah-marie belcastro, Ruth Haas:
Grünbaum colorings of toroidal triangulations. J. Graph Theory 63(1): 68-81 (2010)
2000 – 2009
- 2009
- [j35]Michael O. Albertson, Daniel W. Cranston, Jacob Fox:
Crossings, Colorings, and Cliques. Electron. J. Comb. 16(1) (2009) - 2008
- [j34]Michael O. Albertson:
Chromatic number, independence ratio, and crossing number. Ars Math. Contemp. 1(1): 1-6 (2008) - [j33]Michael O. Albertson, Debra L. Boutin:
Automorphisms and Distinguishing Numbers of Geometric Cliques. Discret. Comput. Geom. 39(4): 778-785 (2008) - 2007
- [j32]Michael O. Albertson, Debra L. Boutin:
Using Determining Sets to Distinguish Kneser Graphs. Electron. J. Comb. 14(1) (2007) - 2006
- [j31]Michael O. Albertson, Bojan Mohar:
Coloring Vertices and Faces of Locally Planar Graphs. Graphs Comb. 22(3): 289-295 (2006) - [j30]Michael O. Albertson, Douglas B. West:
Extending precolorings to circular colorings. J. Comb. Theory B 96(4): 472-481 (2006) - [j29]Michael O. Albertson, Debra L. Boutin:
Distinguishing geometric graphs. J. Graph Theory 53(2): 135-150 (2006) - 2005
- [j28]Michael O. Albertson:
Distinguishing Cartesian Powers of Graphs. Electron. J. Comb. 12 (2005) - 2004
- [j27]Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi:
Coloring with no 2-Colored P4's. Electron. J. Comb. 11(1) (2004) - [j26]Michael O. Albertson, Joan P. Hutchinson:
Extending precolorings of subgraphs of locally planar graphs. Eur. J. Comb. 25(6): 863-871 (2004) - [j25]Michael O. Albertson, Alexandr V. Kostochka, Douglas B. West:
Precoloring Extensions of Brooks' Theorem. SIAM J. Discret. Math. 18(3): 542-553 (2004) - 2002
- [j24]Michael O. Albertson, Joan P. Hutchinson:
Graph Color Extensions: When Hadwiger's Conjecture and Embeddings Help. Electron. J. Comb. 9(1) (2002) - 2001
- [j23]Michael O. Albertson, Emily H. Moore:
Extending graph colorings using no extra colors. Discret. Math. 234(1-3): 125-132 (2001) - [j22]Michael O. Albertson, Joan P. Hutchinson:
Extending colorings of locally planar graphs. J. Graph Theory 36(2): 105-116 (2001) - 2000
- [j21]Michael O. Albertson, Sara Grossman, Ruth Haas:
Partial list colorings. Discret. Math. 214(1-3): 235-240 (2000)
1990 – 1999
- 1999
- [j20]Michael O. Albertson, Emily H. Moore:
Extending Graph Colorings. J. Comb. Theory B 77(1): 83-95 (1999) - 1998
- [j19]Michael O. Albertson:
You Can't Paint Yourself into a Corner. J. Comb. Theory B 73(2): 189-194 (1998) - 1997
- [j18]Michael O. Albertson:
The Irregularity of a Graph. Ars Comb. 46 (1997) - [j17]Michael O. Albertson, Ruth Haas:
The edge chromatic difference sequence of a cubic graph. Discret. Math. 177(1-3): 1-8 (1997) - 1996
- [j16]Michael O. Albertson, Karen L. Collins:
Symmetry Breaking in Graphs. Electron. J. Comb. 3(1) (1996) - [j15]Michael O. Albertson, Ruth Haas:
Parsimonious edge coloring. Discret. Math. 148(1-3): 1-7 (1996) - [j14]Michael O. Albertson, Ruth Haas:
Bounding Functions and Rigid Graphs. SIAM J. Discret. Math. 9(2): 269-273 (1996) - 1994
- [j13]Michael O. Albertson, Debra L. Boutin:
Lower bounds for constant degree independent sets. Discret. Math. 127(1-3): 15-21 (1994) - 1993
- [j12]Michael O. Albertson, Lily Chan, Ruth Haas:
Independence and graph homomorphisms graph homomorphisms. J. Graph Theory 17(5): 581-588 (1993) - 1992
- [j11]Michael O. Albertson:
Turán theorems with repeated degrees. Discret. Math. 100(1-3): 235-241 (1992) - 1991
- [j10]Michael O. Albertson, David M. Berman:
The number of cut-vertices in a graph of given minimum degree. Discret. Math. 89(1): 97-100 (1991) - 1990
- [j9]Michael O. Albertson, David M. Berman, Joan P. Hutchinson, Carsten Thomassen:
Graphs with homeomorphically irreducible spanning trees. J. Graph Theory 14(2): 247-258 (1990)
1980 – 1989
- 1989
- [j8]Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke:
The subchromatic number of a graph. Discret. Math. 74(1-2): 33-49 (1989) - 1985
- [j7]Michael O. Albertson, Karen L. Collins:
Homomorphisms of 3-chromatic graphs. Discret. Math. 54(2): 127-132 (1985) - 1984
- [j6]Michael O. Albertson, Karen L. Collins:
Duality and perfection for edges in cliques. J. Comb. Theory B 36(3): 298-309 (1984) - 1980
- [j5]Michael O. Albertson, Joan P. Hutchinson:
Hadwiger's conjecture for graphs on the Klein bottle. Discret. Math. 29(1): 1-11 (1980) - [j4]Michael O. Albertson, David M. Berman:
Critical graphs for chromatic difference sequences. Discret. Math. 31(3): 225-233 (1980) - [j3]Michael O. Albertson, David M. Berman:
The chromatic difference sequence of a graph. J. Comb. Theory B 29(1): 1-12 (1980)
1970 – 1979
- 1978
- [j2]Michael O. Albertson, Joan P. Hutchinson:
On the independence ratio of a graph. J. Graph Theory 2(1): 1-8 (1978) - 1973
- [j1]Michael O. Albertson:
A case of hadwiger's conjecture. Discret. Math. 4(3): 197-199 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
