The following pages link to Colton Magnant (Q293605):
Displaying 50 items.
- Colored graph homomorphisms (Q2293671) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture (Q2334869) (← links)
- General bounds on rainbow domination numbers (Q2345524) (← links)
- On two conjectures about the proper connection number of graphs (Q2359964) (← links)
- Proper connection with many colors (Q2375854) (← links)
- Forbidden properly edge-colored subgraphs that force large highly connected monochromatic subgraphs (Q2409532) (← links)
- Minimum degree condition for proper connection number 2 (Q2424876) (← links)
- A decomposition of Gallai multigraphs (Q2450129) (← links)
- A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6 (Q2632551) (← links)
- Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs (Q2657090) (← links)
- Implications in rainbow forbidden subgraphs (Q2659179) (← links)
- Gallai-Ramsey number for the union of stars (Q2674387) (← links)
- Gallai-Ramsey numbers for fans (Q2689508) (← links)
- Results and problems on saturation numbers for linear forests (Q2799692) (← links)
- Path partitions of almost regular graphs (Q2800782) (← links)
- Disconnected colors in generalized Gallai-colorings (Q2852614) (← links)
- Rainbow \(k\)-connection in dense graphs (extended abstract) (Q2857372) (← links)
- Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs (Q2870527) (← links)
- Improved upper bounds for Gallai-Ramsey numbers of paths and cycles (Q2874090) (← links)
- Claw-free graphs and 2-factors that separate independent vertices (Q2891039) (← links)
- Extensions of Gallai-Ramsey results (Q2911491) (← links)
- (Q2940105) (← links)
- (Q2960949) (← links)
- (Q2966083) (← links)
- An asymptotic version of a conjecture by Enomoto and Ota (Q3055903) (← links)
- Chvátal-Erdös type theorems (Q3059093) (← links)
- (Q3089225) (← links)
- Distributing vertices on Hamiltonian cycles (Q3113278) (← links)
- Coloring rectangular blocks in 3-space (Q3171423) (← links)
- Integer Solutions to Box Optimization Problems (Q3195406) (← links)
- (Q3565877) (← links)
- (Q3614027) (← links)
- Symplectic meanders (Q4594740) (← links)
- Properly Colored Connectivity of Graphs (Q4636339) (← links)
- Multiply Chorded Cycles (Q4979831) (← links)
- Graphs obtained from collections of blocks (Q5006552) (← links)
- On eternal domination and Vizing-type inequalities (Q5012368) (← links)
- Gallai-Ramsey number of an 8-cycle (Q5012376) (← links)
- Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles (Q5087858) (← links)
- Topics in Gallai-Ramsey Theory (Q5115461) (← links)
- Colored complete hypergraphs containing no rainbow Berge triangles (Q5205656) (← links)
- Note on rainbow connection in oriented graphs with diameter 2 (Q5225507) (← links)
- Second Hamiltonian cycles in claw-free graphs (Q5225510) (← links)
- A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs (Q5225543) (← links)
- (Q5279167) (← links)
- (Q5279726) (← links)
- Gallai–Ramsey number for K5 ${K}_{5}$ (Q6057638) (← links)
- Gallai-Ramsey numbers for fans (Q6314747) (← links)
- Gallai Ramsey number for double stars (Q6332549) (← links)
