The following pages link to Colton Magnant (Q293605):
Displaying 50 items.
- Note on semi-linkage with almost prescribed lengths in large graphs (Q293607) (← links)
- Tight super-edge-graceful labelings of trees and their applications (Q321989) (← links)
- Note on vertex and total proper connection numbers (Q334117) (← links)
- On distance between graphs (Q367064) (← links)
- \(k\)-rainbow domatic numbers (Q423920) (← links)
- Proper connection of graphs (Q442366) (← links)
- Saturation numbers for families of Ramsey-minimal graphs (Q446009) (← links)
- On large semi-linked graphs (Q468447) (← links)
- Note on Enomoto and Ota's conjecture for short paths in large graphs (Q489313) (← links)
- Which tree has the smallest ABC index among trees with \(k\) leaves? (Q494433) (← links)
- Gallai-Ramsey numbers for cycles (Q539886) (← links)
- Meanders and Frobenius seaweed Lie algebras (Q545848) (← links)
- Long path lemma concerning connectivity and independence number (Q554003) (← links)
- Independence number and disjoint theta graphs (Q554004) (← links)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
- Pan-\(H\)-linked graphs (Q604671) (← links)
- Note on highly connected monochromatic subgraphs in 2-colored complete graphs (Q625377) (← links)
- Properly colored paths and cycles (Q642961) (← links)
- Distributing vertices carefully on a Hamiltonian cycle (Q656130) (← links)
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← links)
- The \((k,\ell )\)-proper index of graphs (Q721930) (← links)
- Meander graphs and Frobenius seaweed Lie algebras. II (Q887238) (← links)
- Rainbow paths (Q965956) (← links)
- The unbroken spectrum of type-A Frobenius seaweeds (Q1631378) (← links)
- On list \(r\)-hued coloring of planar graphs (Q1680495) (← links)
- Generalized rainbow connection of graphs and their complements (Q1708384) (← links)
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs (Q1720329) (← links)
- Degree sum and graph linkage with prescribed path lengths (Q1730224) (← links)
- General upper bounds on independent \(k\)-rainbow domination (Q1732101) (← links)
- Proper distance in edge-colored hypercubes (Q1740062) (← links)
- Monochromatic subgraphs in the absence of a properly colored 4-cycle (Q1756081) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← links)
- Gallai-Ramsey numbers for monochromatic triangles or 4-cycles (Q1756099) (← links)
- Enomoto and Ota's conjecture holds for large graphs (Q1756124) (← links)
- Partitioning graphs into paths or cycles of prescribed lengths (Q1937351) (← links)
- Pancyclicity of 4-connected \{claw, generalized bull\}-free graphs (Q1937559) (← links)
- Conditions for families of disjoint \(k\)-connected subgraphs in a graph (Q1942666) (← links)
- Structure of colored complete graphs free of proper cycles (Q1953342) (← links)
- Strong geodetic number of graphs and connectivity (Q1988559) (← links)
- Properly colored \(C_4\)'s in edge-colored graphs (Q2005704) (← links)
- Placing specified vertices at precise locations on a Hamiltonian cycle (Q2014220) (← links)
- Ramsey and Gallai-Ramsey number for wheels (Q2115156) (← links)
- Gallai-Ramsey numbers for rainbow paths (Q2191271) (← links)
- Ramsey and Gallai-Ramsey numbers for stars with extra independent edges (Q2197415) (← links)
- On proper (strong) rainbow connection of graphs (Q2227108) (← links)
- On cycles that alternate through selected sets of vertices (Q2227991) (← links)
- Generalized rainbow connection of graphs (Q2239021) (← links)
- Density of Gallai multigraphs (Q2256125) (← links)
- Gallai-Ramsey numbers for books (Q2274089) (← links)
- The proper diameter of a graph (Q2282468) (← links)
