Pages that link to "Item:Q274703"
From MaRDI portal
The following pages link to Characterizations of graphs having large proper connection numbers (Q274703):
Displaying 14 items.
- On (strong) proper vertex-connection of graphs (Q1695612) (← 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)
- Hardness results for three kinds of colored connections of graphs (Q2202016) (← links)
- On the total proper connection of graphs (Q2272614) (← links)
- Note on directed proper connection number of a random graph (Q2279590) (← links)
- The proper diameter of a graph (Q2282468) (← links)
- On strong proper connection number of cubic graphs (Q2312653) (← links)
- Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) (Q2698135) (← 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)
- Proper‐walk connection number of graphs (Q6055386) (← links)
- The fine-grained complexity of approximately counting proper connected colorings (extended abstract) (Q6606223) (← links)
