The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Michael O. Albertson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael O. Albertson
    The Irregularity of a Graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:46, n:, pp:- [Journal]
  2. Michael O. Albertson, Karen L. Collins
    Symmetry Breaking in Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1996, v:3, n:1, pp:- [Journal]
  3. Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi
    Coloring with no 2-Colored P4's. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  4. Michael O. Albertson, Joan P. Hutchinson
    Graph Color Extensions: When Hadwiger's Conjecture and Embeddings Help. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  5. Michael O. Albertson, Sara Grossman, Ruth Haas
    Partial list colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:214, n:1-3, pp:235-240 [Journal]
  6. Michael O. Albertson, Emily H. Moore
    Extending graph colorings using no extra colors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:125-132 [Journal]
  7. Michael O. Albertson, Joan P. Hutchinson
    Extending precolorings of subgraphs of locally planar graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:6, pp:863-871 [Journal]
  8. Michael O. Albertson, Bojan Mohar
    Coloring Vertices and Faces of Locally Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:3, pp:289-295 [Journal]
  9. Michael O. Albertson
    You Can't Paint Yourself into a Corner. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:73, n:2, pp:189-194 [Journal]
  10. Michael O. Albertson, Karen L. Collins
    Duality and perfection for edges in cliques. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:3, pp:298-309 [Journal]
  11. Michael O. Albertson, Emily H. Moore
    Extending Graph Colorings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:77, n:1, pp:83-95 [Journal]
  12. Michael O. Albertson, Douglas B. West
    Extending precolorings to circular colorings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:472-481 [Journal]
  13. Michael O. Albertson, David M. Berman
    The chromatic difference sequence of a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:29, n:1, pp:1-12 [Journal]
  14. Michael O. Albertson, Alexandr V. Kostochka, Douglas B. West
    Precoloring Extensions of Brooks' Theorem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:3, pp:542-553 [Journal]
  15. Michael O. Albertson, Debra L. Boutin
    Distinguishing geometric graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:53, n:2, pp:135-150 [Journal]
  16. Michael O. Albertson, David M. Berman
    Critical graphs for chromatic difference sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:31, n:3, pp:225-233 [Journal]
  17. Michael O. Albertson, Karen L. Collins
    Homomorphisms of 3-chromatic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:2, pp:127-132 [Journal]
  18. Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke
    The subchromatic number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:33-49 [Journal]
  19. Michael O. Albertson, Ruth Haas
    The edge chromatic difference sequence of a cubic graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:177, n:1-3, pp:1-8 [Journal]
  20. Michael O. Albertson, David M. Berman
    The number of cut-vertices in a graph of given minimum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:89, n:1, pp:97-100 [Journal]
  21. Michael O. Albertson
    Turán theorems with repeated degrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:100, n:1-3, pp:235-241 [Journal]
  22. Michael O. Albertson, Ruth Haas
    Parsimonious edge coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:148, n:1-3, pp:1-7 [Journal]
  23. Michael O. Albertson, Debra L. Boutin
    Lower bounds for constant degree independent sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:127, n:1-3, pp:15-21 [Journal]

  24. Distinguishing Cartesian Powers of Graphs. [Citation Graph (, )][DBLP]


  25. Using Determining Sets to Distinguish Kneser Graphs. [Citation Graph (, )][DBLP]


  26. Automorphisms and Distinguishing Numbers of Geometric Cliques. [Citation Graph (, )][DBLP]


  27. The thickness and chromatic number of r-inflated graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.304secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002