The following pages link to Proper connection of graphs (Q442366):
Displaying 20 items.
- On radio connection number of graphs (Q2416954) (← links)
- Minimum degree condition for proper connection number 2 (Q2424876) (← links)
- Upper bounds for the \(M D\)-numbers and characterization of extremal graphs (Q2661209) (← links)
- The proper vertex-disconnection of graphs (Q2672620) (← links)
- The conflict-free vertex-connection number and degree conditions of graphs (Q2676761) (← links)
- Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) (Q2698135) (← links)
- Proper connection number of bipartite graphs (Q4568221) (← links)
- Proper connection of power graphs of finite groups (Q4988221) (← links)
- Some results on strong conflict-free connection number of graphs (Q5025141) (← links)
- Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles (Q5087858) (← links)
- NOTE ON MINIMUM DEGREE AND PROPER CONNECTION NUMBER (Q5857584) (← 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)
- (1, 2)-rainbow connection number at most 3 in connected dense graphs (Q6090318) (← links)
- (Strong) proper vertex connection of some digraphs (Q6096379) (← links)
- Relations of three classes of disconnected coloring (Q6153478) (← links)
- Loose edge-connection of graphs (Q6166663) (← links)
- Constraining MC-numbers by the connectivity of complement graphs (Q6177407) (← links)
- A survey on conflict-free connection coloring of graphs (Q6497946) (← links)
