Pages that link to "Item:Q510953"
From MaRDI portal
The following pages link to Proper connection number 2, connectivity, and forbidden subgraphs (Q510953):
Displaying 20 items.
- Note on vertex and total proper connection numbers (Q334117) (← links)
- Proper connection of graphs (Q442366) (← links)
- Proper connection number and connected dominating sets (Q896128) (← links)
- Proper connection number of random graphs (Q897901) (← links)
- Proper disconnection of graphs (Q2045273) (← 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)
- On two conjectures about the proper connection number of graphs (Q2359964) (← links)
- Proper connection with many colors (Q2375854) (← 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)
- Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) (Q2698135) (← links)
- Chromatic-connection in graphs (Q2799855) (← links)
- Connecting Terminals and 2-Disjoint Connected Subgraphs (Q2864321) (← links)
- On Graphs with Proper Connection Number 2 (Q3380403) (← links)
- Proper‐walk connection number of graphs (Q6055386) (← links)
- (1, 2)-rainbow connection number at most 3 in connected dense graphs (Q6090318) (← links)
- Loose edge-connection of graphs (Q6166663) (← links)
- The proper 2-connection number of several graph classes (Q6633520) (← links)