The following pages link to Proper connection of graphs (Q442366):
Displaying 17 items.
- Note on vertex and total proper connection numbers (Q334117) (← links)
- Proper connection number 2, connectivity, and forbidden subgraphs (Q510953) (← links)
- On the minimum degree and the proper connection number of graphs (Q510954) (← links)
- The \((k,\ell )\)-proper index of graphs (Q721930) (← links)
- Proper connection numbers of complementary graphs (Q723592) (← links)
- Proper connection number and connected dominating sets (Q896128) (← links)
- Proper connection number of random graphs (Q897901) (← 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)
- Nordhaus-Gaddum-type theorem for total-proper connection number of graphs (Q1712789) (← links)
- Some upper bounds for the 3-proper index of graphs (Q1714011) (← links)
- The \(k\)-proper index of graphs (Q1734744) (← links)
- Graphs with conflict-free connection number two (Q1756118) (← links)
- A survey on conflict-free connection coloring of graphs (Q6497946) (← links)
