Pages that link to "Item:Q2829346"

The following pages link to On proper-path colorings in graphs (Q2829346):

Displaying 50 items.

• Characterizations of graphs having large proper connection numbers (Q274703) (← links)
• Colorful paths in vertex coloring of graphs (Q625379) (← links)
• The \((k,\ell )\)-proper index of graphs (Q721930) (← links)
• Proper connection numbers of complementary graphs (Q723592) (← links)
• Simple proofs of results on paths representing all colors in proper vertex-colorings (Q879947) (← 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)
• Some upper bounds for the 3-proper index of graphs (Q1714011) (← links)
• Proper connection number of graph products (Q1714046) (← links)
• The \(k\)-proper index of graphs (Q1734744) (← links)
• Proper distance in edge-colored hypercubes (Q1740062) (← links)
• Graphs with conflict-free connection number two (Q1756118) (← links)
• The rainbow spanning forest problem (Q1797922) (← 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)
• 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)
• The proper 2-connection number and size of graphs (Q2166240) (← 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)
• Hardness results for three kinds of colored connections of graphs (Q2202016) (← links)
• On proper (strong) rainbow connection of graphs (Q2227108) (← links)
• Conflict-free vertex connection number at most 3 and size of graphs (Q2227116) (← links)
• Generalized rainbow connection of graphs (Q2239021) (← links)
• Multicolorful connectivity of trees (Q2242784) (← links)
• Extremal stretch of proper-walk coloring of graphs (Q2243237) (← 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)
• 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)
• Upper bounds of proper connection number of graphs (Q2410035) (← links)
• On radio connection number of graphs (Q2416954) (← links)
• Minimum degree condition for proper connection number 2 (Q2424876) (← links)
• The proper vertex-disconnection of graphs (Q2672620) (← links)
• The conflict-free vertex-connection number and degree conditions of graphs (Q2676761) (← links)
• Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) (Q2698135) (← links)
• Chromatic-connection in graphs (Q2799855) (← links)
• Colorful paths in vertex coloring of graphs. (Q2828929) (← links)
• Properly colored paths and cycles in complete graphs (Q2887147) (← links)
• (Q3178806) (← links)
• Proper connection number of bipartite graphs (Q4568221) (← links)