default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColton Magnant
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j70]Yaping Mao
, Zhao Wang, Colton Magnant, Ingo Schiermeyer:
Gallai-Ramsey numbers for fans. Discret. Math. 346(5): 113338 (2023)- 2022
- [j69]Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer:
Ramsey and Gallai-Ramsey Number for Wheels. Graphs Comb. 38(2): 42 (2022) - [j68]Colton Magnant, Ingo Schiermeyer:
Gallai-Ramsey number for K 5 ${K}_{5}$. J. Graph Theory 101(3): 455-492 (2022) - 2021
- [j67]Qing Cui, Qinghai Liu, Colton Magnant, Akira Saito:
Implications in rainbow forbidden subgraphs. Discret. Math. 344(4): 112267 (2021) - [j66]Hui Jiang, Wenjing Li, Xueliang Li, Colton Magnant:
On proper (strong) rainbow connection of graphs. Discuss. Math. Graph Theory 41(2): 469-479 (2021) - [j65]Zhao Wang, Yaping Mao, Colton Magnant, Jinyu Zou:
Ramsey and Gallai-Ramsey Numbers for Two Classes of Unicyclic Graphs. Graphs Comb. 37(1): 337-354 (2021) - 2020
- [j64]Keith Driscoll, William F. Klostermeyer, Elliot Krop, Colton Magnant, Patrick Taylor:
On eternal domination and Vizing-type inequalities. AKCE Int. J. Graphs Comb. 17(3): 708-712 (2020) - [j63]Jonathan Gregory, Colton Magnant, Zhuojun Magnant:
Gallai-Ramsey number of an 8-cycle. AKCE Int. J. Graphs Comb. 17(3): 744-748 (2020) - [j62]Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer:
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges. Discret. Appl. Math. 285: 153-172 (2020) - [j61]Chuandong Xu, Colton Magnant, Shenggui Zhang:
Properly colored C4's in edge-colored graphs. Discret. Math. 343(12): 112116 (2020) - [j60]Vincent E. Coll, Jonelle Hook, Colton Magnant, Karen McCready, Kathleen Ryan:
The proper diameter of a graph. Discuss. Math. Graph Theory 40(1): 107-125 (2020) - [j59]Xihe Li, Pierre Besse, Colton Magnant, Li-Gong Wang, Noah Watts:
Gallai-Ramsey Numbers for Rainbow Paths. Graphs Comb. 36(4): 1163-1175 (2020) - [j58]Colton Magnant, Yaping Mao:
On Cycles that Alternate Through Selected Sets of Vertices. Graphs Comb. 36(5): 1517-1523 (2020) - [j57]Henry Liu, Colton Magnant, Akira Saito, Ingo Schiermeyer, Yongtang Shi:
Gallai-Ramsey number for K 4. J. Graph Theory 94(2): 192-205 (2020)
2010 – 2019
- 2019
- [j56]Haibo Wu, Colton Magnant, Pouria Salehi Nowbandegani, Suman Xia:
All partitions have small parts - Gallai-Ramsey numbers of bipartite graphs. Discret. Appl. Math. 254: 196-203 (2019) - [j55]Vincent E. Coll, Colton Magnant, Pouria Salehi Nowbandegani:
Degree sum and graph linkage with prescribed path lengths. Discret. Appl. Math. 257: 85-94 (2019) - [j54]Shinya Fujita, Michitaka Furuya, Colton Magnant:
General upper bounds on independent k-rainbow domination. Discret. Appl. Math. 258: 105-113 (2019) - [j53]Jinyu Zou, Yaping Mao, Colton Magnant, Zhao Wang, Chengfu Ye:
Gallai-Ramsey numbers for books. Discret. Appl. Math. 268: 164-177 (2019) - [j52]Ajay Arora, Eddie Cheng, Colton Magnant:
Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles. Parallel Process. Lett. 29(4): 1950016:1-1950016:9 (2019) - [j51]Fei Huang, Xueliang Li, Zhongmei Qin, Colton Magnant:
Minimum degree condition for proper connection number 2. Theor. Comput. Sci. 774: 44-50 (2019) - [i1]Chuandong Xu, Colton Magnant, Shenggui Zhang:
Properly colored $C_{4}$'s in edge-colored graphs. CoRR abs/1905.10584 (2019) - 2018
- [j50]Hui Lei, Henry Liu, Colton Magnant, Yongtang Shi:
Total rainbow connection of digraphs. Discret. Appl. Math. 236: 288-305 (2018) - [j49]Xueliang Li, Colton Magnant, Meiqin Wei, Xiaoyu Zhu:
Generalized rainbow connection of graphs and their complements. Discuss. Math. Graph Theory 38(2): 371-384 (2018) - [j48]Colton Magnant, Daniel M. Martin, Pouria Salehi Nowbandegani:
Monochromatic Subgraphs in the Absence of a Properly Colored 4-Cycle. Graphs Comb. 34(6): 1147-1158 (2018) - [j47]Randy Davila, Michael A. Henning, Colton Magnant, Ryan Pepper:
Bounds on the Connected Forcing Number of a Graph. Graphs Comb. 34(6): 1159-1174 (2018) - [j46]Haibo Wu, Colton Magnant:
Gallai-Ramsey Numbers for Monochromatic Triangles or 4-Cycles. Graphs Comb. 34(6): 1315-1324 (2018) - [j45]Vincent E. Coll, Alexander Halperin, Colton Magnant, Pouria Salehi Nowbandegani:
Enomoto and Ota's Conjecture Holds for Large Graphs. Graphs Comb. 34(6): 1619-1635 (2018) - [j44]Hong Chang, Xueliang Li, Colton Magnant, Zhongmei Qin:
The (k , ℓ)-proper index of graphs. J. Comb. Optim. 36(2): 458-471 (2018) - 2017
- [j43]Eddie Cheng, Colton Magnant, Dhruv Medarametla:
Proper distance in edge-colored hypercubes. Appl. Math. Comput. 313: 384-391 (2017) - [j42]Yu Yang, Hongbo Liu, Hua Wang, Ansheng Deng, Colton Magnant:
On Algorithms for Enumerating Subtrees of Hexagonal and Phenylene Chains. Comput. J. 60(5): 690-710 (2017) - [j41]Fei Huang, Xueliang Li, Zhongmei Qin, Colton Magnant, Kenta Ozeki:
On two conjectures about the proper connection number of graphs. Discret. Math. 340(9): 2217-2222 (2017) - [j40]Ronald J. Gould, Colton Magnant, Pouria Salehi Nowbandegani:
Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle. Graphs Comb. 33(2): 369-385 (2017) - [j39]Robert Katic, Colton Magnant, Pouria Salehi Nowbandegani:
Forbidden Properly Edge-Colored Subgraphs that Force Large Highly Connected Monochromatic Subgraphs. Graphs Comb. 33(4): 969-979 (2017) - 2016
- [j38]Colton Magnant, Hua Wang, Shuai Yuan:
Path partitions of almost regular graphs. Australas. J Comb. 64: 334-340 (2016) - [j37]Emily Chizmar, Colton Magnant, Pouria Salehi Nowbandegani:
Note on vertex and total proper connection numbers. AKCE Int. J. Graphs Comb. 13(2): 103-106 (2016) - [j36]Emily Chizmar, Colton Magnant, Pouria Salehi Nowbandegani:
Note on Semi-Linkage with Almost Prescribed Lengths in Large Graphs. Graphs Comb. 32(3): 881-886 (2016) - 2015
- [j35]Alex Collins, Colton Magnant, Hua Wang:
Tight super-edge-graceful labelings of trees and their applications. AKCE Int. J. Graphs Comb. 12(Issues): 113-118 (2015) - [j34]Colton Magnant:
Density of Gallai Multigraphs. Electron. J. Comb. 22(1): 1 (2015) - [j33]Colton Magnant, Pouria Salehi Nowbandegani, Ivan Gutman:
Which tree has the smallest ABC index among trees with k leaves? Discret. Appl. Math. 194: 143-146 (2015) - [j32]Alexander Halperin, Colton Magnant, Hua Wang:
On large semi-linked graphs. Discret. Math. 338(1): 122-129 (2015) - [j31]Colton Magnant, Pouria Salehi Nowbandegani, Hua Wang:
Graphs obtained from collections of blocks. Electron. J. Graph Theory Appl. 3(1): 50-55 (2015) - [j30]Shinya Fujita, Michitaka Furuya, Colton Magnant:
General Bounds on Rainbow Domination Numbers. Graphs Comb. 31(3): 601-613 (2015) - 2014
- [j29]Alexander Halperin, Colton Magnant, Kyle Pula:
A decomposition of Gallai multigraphs. Discuss. Math. Graph Theory 34(2): 331-352 (2014) - [j28]Martin Hall, Colton Magnant, Hua Wang:
Note on Enomoto and Ota's Conjecture for Short Paths in Large Graphs. Graphs Comb. 30(6): 1463-1467 (2014) - [j27]Martin Hall, Colton Magnant, Kenta Ozeki, Masao Tsugaki:
Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles. J. Graph Theory 75(1): 59-74 (2014) - [j26]Ronald J. Gould, Paul Horn, Colton Magnant:
Multiply Chorded Cycles. SIAM J. Discret. Math. 28(1): 160-172 (2014) - 2013
- [j25]Michael Ferrara, Silke Gehrke, Ronald J. Gould, Colton Magnant, Jeffrey S. Powell:
Pancyclicity of 4-connected {claw, generalized bull}-free graphs. Discret. Math. 313(4): 460-467 (2013) - [j24]Michael Ferrara, Colton Magnant, Paul S. Wenger:
Conditions for families of disjoint k-connected subgraphs in a graph. Discret. Math. 313(6): 760-764 (2013) - [j23]Alexander Halperin, Colton Magnant, Daniel M. Martin:
On Distance Between Graphs. Graphs Comb. 29(5): 1391-1402 (2013) - [j22]Shinya Fujita, András Gyárfás, Colton Magnant, Ákos Seress:
Disconnected Colors in Generalized Gallai-Colorings. J. Graph Theory 74(1): 104-114 (2013) - [j21]Shinya Fujita, Colton Magnant:
Forbidden Rainbow Subgraphs That Force Large Highly Connected Monochromatic Subgraphs. SIAM J. Discret. Math. 27(3): 1625-1637 (2013) - 2012
- [j20]Vincent E. Coll, Colton Magnant, Kathleen Ryan:
Structure of Colored Complete Graphs Free of Proper Cycles. Electron. J. Comb. 19(4): 33 (2012) - [j19]Shinya Fujita, Michitaka Furuya, Colton Magnant:
k-Rainbow domatic numbers. Discret. Appl. Math. 160(7-8): 1104-1113 (2012) - [j18]Valentin Borozan, Shinya Fujita, Aydin Gerek, Colton Magnant, Yannis Manoussakis, Leandro Montero, Zsolt Tuza:
Proper connection of graphs. Discret. Math. 312(17): 2550-2560 (2012) - [j17]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Distributing vertices on Hamiltonian cycles. J. Graph Theory 69(1): 28-45 (2012) - [j16]Ralph J. Faudree, Colton Magnant, Kenta Ozeki, Kiyoshi Yoshimoto:
Claw-free graphs and 2-factors that separate independent vertices. J. Graph Theory 69(3): 251-263 (2012) - [j15]Shinya Fujita, Colton Magnant:
Extensions of Gallai-Ramsey results. J. Graph Theory 70(4): 404-426 (2012) - 2011
- [j14]Shinya Fujita, Alexander Halperin, Colton Magnant:
Long Path Lemma concerning Connectivity and Independence Number. Electron. J. Comb. 18(1) (2011) - [j13]Shinya Fujita, Colton Magnant:
Note on Highly Connected Monochromatic Subgraphs in 2-Colored Complete Graphs. Electron. J. Comb. 18(1) (2011) - [j12]Shinya Fujita, Colton Magnant:
Independence Number and Disjoint Theta Graphs. Electron. J. Comb. 18(1) (2011) - [j11]Shinya Fujita, Colton Magnant:
Properly colored paths and cycles. Discret. Appl. Math. 159(14): 1391-1397 (2011) - [j10]Shinya Fujita, Colton Magnant:
Gallai-Ramsey numbers for cycles. Discret. Math. 311(13): 1247-1254 (2011) - [j9]Colton Magnant, Daniel M. Martin:
Coloring rectangular blocks in 3-space. Discuss. Math. Graph Theory 31(1): 161-170 (2011) - [j8]Shinya Fujita, Henry Liu, Colton Magnant:
Rainbow k-connection in Dense Graphs (Extended Abstract). Electron. Notes Discret. Math. 38: 361-366 (2011) - 2010
- [j7]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Ramsey numbers in rainbow triangle free colorings. Australas. J Comb. 46: 269-284 (2010) - [j6]Domingos Dellamonica Jr., Colton Magnant, Daniel M. Martin:
Rainbow paths. Discret. Math. 310(4): 774-781 (2010) - [j5]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Chvátal-Erdös type theorems. Discuss. Math. Graph Theory 30(2): 245-256 (2010) - [j4]Shinya Fujita, Colton Magnant, Kenta Ozeki:
Rainbow Generalizations of Ramsey Theory: A Survey. Graphs Comb. 26(1): 1-30 (2010) - [j3]Michael Ferrara, Colton Magnant, Jeffrey S. Powell:
Pan-H-Linked Graphs. Graphs Comb. 26(2): 225-242 (2010) - [j2]Colton Magnant, Daniel M. Martin:
An asymptotic version of a conjecture by Enomoto and Ota. J. Graph Theory 64(1): 37-51 (2010)
2000 – 2009
- 2009
- [j1]Colton Magnant, Daniel M. Martin:
A note on the path cover number of regular graphs. Australas. J Comb. 43: 211-218 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
