Pages that link to "Item:Q897901"
From MaRDI portal
The following pages link to Proper connection number of random graphs (Q897901):
Displaying 17 items.
- The \((k,\ell )\)-proper index of graphs (Q721930) (← links)
- Conflict-free connections of graphs (Q1656907) (← links)
- Coloring graphs to produce properly colored walks (Q1684944) (← 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)
- Two sufficient conditions for 2-connected graphs to have proper connection number 2 (Q2186294) (← links)
- Conflict-free connection number of random graphs (Q2192106) (← links)
- Optimal proper connection of graphs (Q2192984) (← links)
- Hardness results for three kinds of colored connections of graphs (Q2202016) (← links)
- The optimal proper connection number of a graph with given independence number (Q2234746) (← links)
- On the total proper connection of graphs (Q2272614) (← links)
- Note on directed proper connection number of a random graph (Q2279590) (← links)
- On two conjectures about the proper connection number of graphs (Q2359964) (← links)
- Minimum degree condition for proper connection number 2 (Q2424876) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5918844) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5920180) (← links)
