Colton Magnant

According to our database1, Colton Magnant authored at least 60 papers between 2009 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




Gallai-Ramsey number for K 4.
Journal of Graph Theory, 2020

Gallai-Ramsey Numbers for Rainbow Paths.
Graphs Comb., 2020

The proper diameter of a graph.
Discuss. Math. Graph Theory, 2020

Minimum degree condition for proper connection number 2.
Theor. Comput. Sci., 2019

Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles.
Parallel Process. Lett., 2019

Gallai-Ramsey numbers for books.
Discret. Appl. Math., 2019

All partitions have small parts - Gallai-Ramsey numbers of bipartite graphs.
Discret. Appl. Math., 2019

General upper bounds on independent k-rainbow domination.
Discret. Appl. Math., 2019

Degree sum and graph linkage with prescribed path lengths.
Discret. Appl. Math., 2019

Properly colored $C_{4}$'s in edge-colored graphs.
CoRR, 2019

The (k , ℓ)-proper index of graphs.
J. Comb. Optim., 2018

Gallai-Ramsey Numbers for Monochromatic Triangles or 4-Cycles.
Graphs Comb., 2018

Monochromatic Subgraphs in the Absence of a Properly Colored 4-Cycle.
Graphs Comb., 2018

Bounds on the Connected Forcing Number of a Graph.
Graphs Comb., 2018

Enomoto and Ota's Conjecture Holds for Large Graphs.
Graphs Comb., 2018

Generalized rainbow connection of graphs and their complements.
Discuss. Math. Graph Theory, 2018

Total rainbow connection of digraphs.
Discret. Appl. Math., 2018

Forbidden Properly Edge-Colored Subgraphs that Force Large Highly Connected Monochromatic Subgraphs.
Graphs Comb., 2017

Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle.
Graphs Comb., 2017

On two conjectures about the proper connection number of graphs.
Discret. Math., 2017

On Algorithms for Enumerating Subtrees of Hexagonal and Phenylene Chains.
Comput. J., 2017

Proper distance in edge-colored hypercubes.
Appl. Math. Comput., 2017

Note on Semi-Linkage with Almost Prescribed Lengths in Large Graphs.
Graphs Comb., 2016

Note on vertex and total proper connection numbers.
AKCE Int. J. Graphs Comb., 2016

Path partitions of almost regular graphs.
Australas. J Comb., 2016

General Bounds on Rainbow Domination Numbers.
Graphs Comb., 2015

Graphs obtained from collections of blocks.
Electron. J. Graph Theory Appl., 2015

On large semi-linked graphs.
Discret. Math., 2015

Which tree has the smallest ABC index among trees with k leaves?
Discret. Appl. Math., 2015

Density of Gallai Multigraphs.
Electr. J. Comb., 2015

Tight super-edge-graceful labelings of trees and their applications.
AKCE Int. J. Graphs Comb., 2015

Multiply Chorded Cycles.
SIAM J. Discret. Math., 2014

Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles.
Journal of Graph Theory, 2014

Note on Enomoto and Ota's Conjecture for Short Paths in Large Graphs.
Graphs Comb., 2014

A decomposition of Gallai multigraphs.
Discuss. Math. Graph Theory, 2014

Forbidden Rainbow Subgraphs That Force Large Highly Connected Monochromatic Subgraphs.
SIAM J. Discret. Math., 2013

Disconnected Colors in Generalized Gallai-Colorings.
Journal of Graph Theory, 2013

On Distance Between Graphs.
Graphs Comb., 2013

Conditions for families of disjoint k-connected subgraphs in a graph.
Discret. Math., 2013

Pancyclicity of 4-connected {claw, generalized bull}-free graphs.
Discret. Math., 2013

Extensions of Gallai-Ramsey results.
Journal of Graph Theory, 2012

Claw-free graphs and 2-factors that separate independent vertices.
Journal of Graph Theory, 2012

Distributing vertices on Hamiltonian cycles.
Journal of Graph Theory, 2012

Proper connection of graphs.
Discret. Math., 2012

k-Rainbow domatic numbers.
Discret. Appl. Math., 2012

Structure of Colored Complete Graphs Free of Proper Cycles.
Electr. J. Comb., 2012

Rainbow k-connection in Dense Graphs (Extended Abstract).
Electron. Notes Discret. Math., 2011

Coloring rectangular blocks in 3-space.
Discuss. Math. Graph Theory, 2011

Gallai-Ramsey numbers for cycles.
Discret. Math., 2011

Properly colored paths and cycles.
Discret. Appl. Math., 2011

Independence Number and Disjoint Theta Graphs.
Electr. J. Comb., 2011

Note on Highly Connected Monochromatic Subgraphs in 2-Colored Complete Graphs.
Electr. J. Comb., 2011

Long Path Lemma concerning Connectivity and Independence Number.
Electr. J. Comb., 2011

An asymptotic version of a conjecture by Enomoto and Ota.
Journal of Graph Theory, 2010

Rainbow Generalizations of Ramsey Theory: A Survey.
Graphs Comb., 2010

Pan-H-Linked Graphs.
Graphs Comb., 2010

Chvátal-Erdös type theorems.
Discuss. Math. Graph Theory, 2010

Rainbow paths.
Discret. Math., 2010

Ramsey numbers in rainbow triangle free colorings.
Australas. J Comb., 2010

A note on the path cover number of regular graphs.
Australas. J Comb., 2009