Pages that link to "Item:Q2829346"
From MaRDI portal
The following pages link to On proper-path colorings in graphs (Q2829346):
Displaying 14 items.
- 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)
- (Q5121928) (← links)
- (Q5260297) (← 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)
- (1, 2)-rainbow connection number at most 3 in connected dense graphs (Q6090318) (← links)
- Relations of three classes of disconnected coloring (Q6153478) (← links)
- Proper colorability of segment intersection graphs (Q6168981) (← links)
- The fine-grained complexity of approximately counting proper connected colorings (extended abstract) (Q6606223) (← links)
- Some results on (strong) total proper connection number of some digraphs (Q6611051) (← links)
- The proper 2-connection number of several graph classes (Q6633520) (← links)
- Counting on rainbow \(k\)-connections (Q6636091) (← links)