The following pages link to Michael O. Albertson (Q186192):
Displayed 50 items.
- Duality and perfection for edges in cliques (Q595674) (← links)
- Graph color extensions: When Hadwiger's conjecture and embeddings help (Q698612) (← links)
- The thickness and chromatic number of \(r\)-inflated graphs (Q709322) (← links)
- Coloring vertices and faces of locally planar graphs (Q855294) (← links)
- Using determining sets to distinguish Kneser graphs (Q870080) (← links)
- Automorphisms and distinguishing numbers of geometric cliques (Q938315) (← links)
- Crossings, colorings, and cliques (Q1028822) (← links)
- Homomorphisms of 3-chromatic graphs (Q1062066) (← links)
- Hadwiger's conjecture for graphs on the Klein bottle (Q1142782) (← links)
- Critical graphs for chromatic difference sequences (Q1144038) (← links)
- The number of cut-vertices in a graph of given minimum degree (Q1176737) (← links)
- Turán theorems with repeated degrees (Q1198646) (← links)
- Every planar graph has an acyclic 7-coloring (Q1245228) (← links)
- The chromatic difference sequence of a graph (Q1246543) (← links)
- You can't paint yourself into a corner (Q1272489) (← links)
- Lower bounds for constant degree independent sets (Q1322210) (← links)
- The edge chromatic difference sequence of a cubic graph (Q1377864) (← links)
- Extending graph colorings (Q1569052) (← links)
- (Q1823254) (redirect page) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- A lower bound for the independence number of a planar graph (Q1845888) (← links)
- Extending precolorings of subgraphs of locally planar graphs (Q1883295) (← links)
- Coloring with no 2-colored \(P_4\)'s (Q1883636) (← links)
- Parsimonious edge coloring (Q1910535) (← links)
- Symmetry breaking in graphs (Q1918875) (← links)
- Partial list colorings (Q1972145) (← links)
- Realizing finite groups in Euclidean space (Q1972434) (← links)
- Extending precolorings to circular colorings (Q2496199) (← links)
- A case of Hadwiger's conjecture (Q2556339) (← links)
- Extending colorings of locally planar graphs (Q2707977) (← links)
- Disjoint homometric sets in graphs (Q3119053) (← links)
- More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number (Q3119054) (← links)
- Combinatorial Aspects of the Orrery Model of Syntax (Q3332274) (← links)
- Distinguishing geometric graphs (Q3419706) (← links)
- (Q3475293) (← links)
- Chromatic number, independence ratio, and crossing number (Q3535837) (← links)
- Locally Planar Toroidal Graphs are 5-Colorable (Q3666872) (← links)
- (Q3697034) (← links)
- (Q3758851) (← links)
- (Q3772263) (← links)
- (Q3838179) (← links)
- (Q3910544) (← links)
- (Q3950572) (← links)
- Covering Regions with Squares (Q3963050) (← links)
- (Q4028493) (← links)
- (Q4040509) (← links)
- (Q4046066) (← links)
- (Q4060989) (← links)
- The maximum size of an independent set in a nonplanar graph (Q4068742) (← links)
- (Q4078056) (← links)