Pages that link to "Item:Q2401802"
From MaRDI portal
The following pages link to Proper connection and size of graphs (Q2401802):
Displaying 21 items.
- Characterizations of graphs having large proper connection numbers (Q274703) (← links)
- Proper connection of graphs (Q442366) (← links)
- Proper connection numbers of complementary graphs (Q723592) (← links)
- Proper connection number of random graphs (Q897901) (← links)
- Conflict-free connections of graphs (Q1656907) (← links)
- Graphs with conflict-free connection number two (Q1756118) (← links)
- Odd connection and odd vertex-connection of graphs (Q1800421) (← links)
- Minimum degree and size conditions for the proper connection number of graphs (Q2010690) (← links)
- Proper disconnection of graphs (Q2045273) (← links)
- From colourful to rainbow paths in graphs: colouring the vertices (Q2051888) (← links)
- Conflict-free connection number and size of graphs (Q2051890) (← links)
- Some results on the total proper \(k\)-connection number (Q2135063) (← links)
- The proper 2-connection number and size of graphs (Q2166240) (← links)
- Conflict-free vertex connection number at most 3 and size of graphs (Q2227116) (← 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)
- Proper connection of direct products (Q2409790) (← links)
- Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) (Q2698135) (← links)
- On Graphs with Proper Connection Number 2 (Q3380403) (← links)
- Loose edge-connection of graphs (Q6166663) (← links)
