Pages that link to "Item:Q1695612"
From MaRDI portal
The following pages link to On (strong) proper vertex-connection of graphs (Q1695612):
Displaying 13 items.
- Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks (Q1637216) (← links)
- (Strong) total proper connection of some digraphs (Q2045035) (← links)
- Some results on the total proper \(k\)-connection number (Q2135063) (← links)
- Conflict-free vertex connection number at most 3 and size of graphs (Q2227116) (← links)
- On the total proper connection of graphs (Q2272614) (← links)
- On radio connection number of graphs (Q2416954) (← links)
- The conflict-free vertex-connection number and degree conditions of graphs (Q2676761) (← links)
- An open research problem: strong completeness of R Kowalski's connection graph proof procedure (Q4532365) (← links)
- (Q4733671) (← links)
- Strong subgraph <i>k</i>‐connectivity (Q5241602) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5918844) (← links)
- (Strong) proper vertex connection of some digraphs (Q6096379) (← links)
- Some results on (strong) total proper connection number of some digraphs (Q6611051) (← links)