Pages that link to "Item:Q2409521"

The following pages link to Minimum degree conditions for the proper connection number of graphs (Q2409521):

Displaying 13 items.

• Properly colored trails, paths, and bridges (Q1702827) (← links)
• Graphs with conflict-free connection number two (Q1756118) (← links)
• Conflict-free connection number and independence number of a graph (Q2025169) (← 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)
• Optimal proper connection of graphs (Q2192984) (← links)
• The optimal proper connection number of a graph with given independence number (Q2234746) (← links)
• On two conjectures about the proper connection number of graphs (Q2359964) (← links)
• The conflict-free vertex-connection number and degree conditions of graphs (Q2676761) (← links)
• NOTE ON MINIMUM DEGREE AND PROPER CONNECTION NUMBER (Q5857584) (← links)
• On the (di)graphs with (directed) proper connection number two (Q5918844) (← links)
• Proper‐walk connection number of graphs (Q6055386) (← links)