Pages that link to "Item:Q510954"
From MaRDI portal
The following pages link to On the minimum degree and the proper connection number of graphs (Q510954):
Displaying 21 items.
- Note on vertex and total proper connection numbers (Q334117) (← links)
- Properties of connected graphs having minimum degree distance (Q1043622) (← links)
- Extraconnectivity of graphs with large minimum degree and girth (Q1356447) (← links)
- Minimum degree and size conditions for the proper connection number of graphs (Q2010690) (← 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)
- The optimal proper connection number of a graph with given independence number (Q2234746) (← links)
- Proper connection with many colors (Q2375854) (← links)
- Minimum degree conditions for the proper connection number of graphs (Q2409521) (← links)
- Minimum degree condition for proper connection number 2 (Q2424876) (← links)
- The conflict-free vertex-connection number and degree conditions of graphs (Q2676761) (← links)
- On Graphs with Proper Connection Number 2 (Q3380403) (← links)
- (Q3744189) (← links)
- Connectivity, graph minors, and subgraph multiplicity (Q4201396) (← links)
- (Q4873681) (← links)
- Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs (Q5019804) (← links)
- Proper‐walk connection number of graphs (Q6055386) (← links)
- (1, 2)-rainbow connection number at most 3 in connected dense graphs (Q6090318) (← links)
- The proper 2-connection number of several graph classes (Q6633520) (← links)
- List proper connection of 2-edge-connected graphs (Q6644889) (← links)
