The following pages link to Proper connection of graphs (Q442366):
Displaying 50 items.
- Note on vertex and total proper connection numbers (Q334117) (← links)
- Proper connection number 2, connectivity, and forbidden subgraphs (Q510953) (← links)
- On the minimum degree and the proper connection number of graphs (Q510954) (← links)
- The \((k,\ell )\)-proper index of graphs (Q721930) (← links)
- Proper connection numbers of complementary graphs (Q723592) (← links)
- Proper connection number and connected dominating sets (Q896128) (← links)
- Proper connection number of random graphs (Q897901) (← links)
- Conflict-free connections of graphs (Q1656907) (← links)
- Coloring graphs to produce properly colored walks (Q1684944) (← links)
- On (strong) proper vertex-connection of graphs (Q1695612) (← links)
- Properly colored trails, paths, and bridges (Q1702827) (← links)
- Generalized rainbow connection of graphs and their complements (Q1708384) (← links)
- Nordhaus-Gaddum-type theorem for total-proper connection number of graphs (Q1712789) (← links)
- Some upper bounds for the 3-proper index of graphs (Q1714011) (← links)
- The \(k\)-proper index of graphs (Q1734744) (← links)
- Graphs with conflict-free connection number two (Q1756118) (← links)
- Odd connection and odd vertex-connection of graphs (Q1800421) (← links)
- Minimum degree and size conditions for the proper connection number of graphs (Q2010690) (← links)
- Conflict-free connection number and independence number of a graph (Q2025169) (← links)
- Digraphs with proper connection number two (Q2034401) (← links)
- (Strong) total proper connection of some digraphs (Q2045035) (← links)
- Complexity results for two kinds of colored disconnections of graphs (Q2045036) (← links)
- From colourful to rainbow paths in graphs: colouring the vertices (Q2051888) (← links)
- Conflict-free connection number and size of graphs (Q2051890) (← links)
- Some results on the total proper \(k\)-connection number (Q2135063) (← links)
- Proper-walk connection of Hamiltonian digraphs (Q2141233) (← links)
- The proper 2-connection number and size of graphs (Q2166240) (← links)
- Degree sums and proper connection number of graphs (Q2172419) (← links)
- Two sufficient conditions for 2-connected graphs to have proper connection number 2 (Q2186294) (← links)
- Conflict-free connection number of random graphs (Q2192106) (← links)
- Optimal proper connection of graphs (Q2192984) (← links)
- Hardness results for three kinds of colored connections of graphs (Q2202016) (← links)
- Conflict-free vertex connection number at most 3 and size of graphs (Q2227116) (← links)
- The optimal proper connection number of a graph with given independence number (Q2234746) (← links)
- Generalized rainbow connection of graphs (Q2239021) (← links)
- Multicolorful connectivity of trees (Q2242784) (← links)
- Extremal stretch of proper-walk coloring of graphs (Q2243237) (← links)
- Proper connection and proper-walk connection of digraphs (Q2245028) (← links)
- On the total proper connection of graphs (Q2272614) (← links)
- Note on directed proper connection number of a random graph (Q2279590) (← links)
- The proper diameter of a graph (Q2282468) (← links)
- (Strong) conflict-free connectivity: algorithm and complexity (Q2283032) (← links)
- Strong conflict-free connection of graphs (Q2284053) (← links)
- On strong proper connection number of cubic graphs (Q2312653) (← links)
- Number of proper paths in edge-colored hypercubes (Q2333260) (← links)
- On two conjectures about the proper connection number of graphs (Q2359964) (← links)
- Proper connection and size of graphs (Q2401802) (← links)
- Minimum degree conditions for the proper connection number of graphs (Q2409521) (← links)
- Proper connection of direct products (Q2409790) (← links)
- Upper bounds of proper connection number of graphs (Q2410035) (← links)
