The following pages link to Dan S. Archdeacon (Q592090):
Displaying 50 items.
- Local rainbow colorings (Q433480) (← links)
- (Q489299) (redirect page) (← links)
- Steiner triple systems, pinched surfaces, and complete multigraphs (Q489300) (← links)
- (Q587592) (redirect page) (← links)
- Obstructions for embedding cubic graphs on the spindle surface (Q598469) (← links)
- Vertex-coloring 2-edge-weighting of graphs (Q607360) (← links)
- A note on obstructions to clustered planarity (Q640411) (← links)
- On the order dimension of outerplanar maps (Q651434) (← links)
- On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic (Q666002) (← links)
- On generalized perfect graphs: Bounded degree and bounded edge perfection (Q686267) (← links)
- List colourings of planar graphs (Q687126) (← links)
- The efficient recognition on net-extensibility of graphs (Q687910) (← links)
- Graph minors. XX: Wagner's conjecture (Q705888) (← links)
- Representing graphs in Steiner triple systems (Q742566) (← links)
- The surviving rate of planar graphs (Q764317) (← links)
- (Q807630) (redirect page) (← links)
- Dispersed points and geometric embedding of complete bipartite graphs (Q807631) (← links)
- Square integer Heffter arrays with empty cells (Q887425) (← links)
- Densely embedded graphs (Q908930) (← links)
- The construction and classification of self-dual spherical polyhedra (Q910715) (← links)
- Operations on hypermaps, and outer automorphisms (Q912117) (← links)
- Uniqueness of maximum planar five-distance sets (Q924997) (← links)
- Decomposing a planar graph with girth 9 into a forest and a matching (Q925026) (← links)
- On embedding well-separable graphs (Q941369) (← links)
- Preface: Old and new perspectives on the Tutte polynomial (Q941618) (← links)
- On the existence of nested orthogonal arrays (Q942093) (← links)
- On a generalization of the Evans Conjecture (Q942105) (← links)
- A note on chain lengths and the Tutte polynomial (Q952642) (← links)
- On the completability of incomplete Latin squares (Q966163) (← links)
- Crossing-critical graphs with large maximum degree (Q974468) (← links)
- Planar graphs without 5-cycles or without 6-cycles (Q1025913) (← links)
- Perpendicular rectangular Latin arrays (Q1043793) (← links)
- On cubic graphs which are irreducible for nonorientable surfaces (Q1066151) (← links)
- Regular orientable imbeddings of complete graphs (Q1070238) (← links)
- A characterization of absolute retracts of n-chromatic graphs (Q1076682) (← links)
- Vector colorability (Q1100473) (← links)
- (Q1118606) (redirect page) (← links)
- Genus distributions for two classes of graphs (Q1118607) (← links)
- Some new row-complete latin squares (Q1145153) (← links)
- Constructing indecomposable 1-factorizations of the complete multigraph (Q1182917) (← links)
- On the chromatic uniqueness of certain bipartite graphs (Q1182976) (← links)
- The chromatic uniqueness of complete bipartite graphs (Q1182979) (← links)
- The chromatic uniqueness of certain broken wheels (Q1182985) (← links)
- The 2 and 3 representative projective planar embeddings (Q1186128) (← links)
- Self-dual embeddings of complete bipartite graphs (Q1193565) (← links)
- The medial graph and voltage-current duality (Q1196985) (← links)
- Limit points for average genus. II: 2-connected non-simplicial graphs (Q1204469) (← links)
- Kuratowski-type theorems for average genus (Q1204482) (← links)
- On spanning subgraphs of 4-connected planar graphs (Q1262872) (← links)
- A Nebeský-type characterization for relative maximum genus (Q1272649) (← links)
