The following pages link to Karen L. Collins (Q234314):
Displayed 39 items.
- Split graphs and Nordhaus-Gaddum graphs (Q297938) (← links)
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- Duality and perfection for edges in cliques (Q595674) (← links)
- The distinguishing chromatic number (Q815210) (← links)
- Homomorphisms of 3-chromatic graphs (Q1062066) (← links)
- A lower bound for 0,1,* tournament codes (Q1095111) (← links)
- Planar lattices are lexicographically shellable (Q1198483) (← links)
- Factoring distance matrix polynomials (Q1313852) (← links)
- An inversion relation of multinomial type (Q1332421) (← links)
- The number of Hamiltonian paths in a rectangular grid (Q1357721) (← links)
- An upper bound on Wiener indices of maximal planar graphs (Q1732098) (← links)
- Finding balance: split graphs and related classes (Q1753048) (← links)
- Symmetry breaking in graphs (Q1918875) (← links)
- The distinguishing chromatic number of Kneser graphs (Q1953404) (← links)
- Product throttling (Q2073191) (← links)
- The distinguishing number and distinguishing chromatic number for posets (Q2088064) (← links)
- Great-circle tree thrackles (Q2092339) (← links)
- On a conjecture of Graham and Lovász about distance matrices (Q2276978) (← links)
- Bounds on the distinguishing chromatic number (Q2380243) (← links)
- Constructing Graphs with No Immersion of Large Complete Graphs (Q2922213) (← links)
- (Q3348914) (← links)
- (Q3360909) (← links)
- Retracts of box products with odd-angulated factors (Q3418731) (← links)
- Odd-angulated graphs and cancelling factors in box products (Q3522848) (← links)
- Circulants and Sequences (Q4388998) (← links)
- Constructions of 3-Colorable Cores (Q4785707) (← links)
- Dependent edges in Mycielski graphs and 4‐colorings of 4‐skeletons (Q4810503) (← links)
- (Q4934398) (← links)
- (Q4949875) (← links)
- Split graphs (Q5058673) (← links)
- (Q5883635) (← links)
- On planar and dismantlable lattices (Q5957709) (← links)
- Clique immersion in graph products (Q6041549) (← links)
- Split graphs and block representations (Q6197725) (← links)
- Treewidth Bounds for Planar Graphs Using Three-Sided Brambles (Q6288323) (← links)
- An upper bound on the Wiener Index of a k-connected graph (Q6309320) (← links)
- The distinguishing number and distinguishing chromatic number for posets (Q6319264) (← links)
- Product throttling for power domination (Q6352657) (← links)
- A Note on the Immersion Number of Generalized Mycielski Graphs (Q6367503) (← links)