Pages that link to "Item:Q2410035"
From MaRDI portal
The following pages link to Upper bounds of proper connection number of graphs (Q2410035):
Displaying 12 items.
- Proper connection number 2, connectivity, and forbidden subgraphs (Q510953) (← links)
- Proper connection number and connected dominating sets (Q896128) (← links)
- Properly colored trails, paths, and bridges (Q1702827) (← links)
- Proper connection number of graph products (Q1714046) (← links)
- Some results on the total proper \(k\)-connection number (Q2135063) (← 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 the total proper connection of graphs (Q2272614) (← links)
- On strong proper connection number of cubic graphs (Q2312653) (← links)
- Upper bound on the third edge-connectivity of graphs (Q2574674) (← links)