Pages that link to "Item:Q2424876"
From MaRDI portal
The following pages link to Minimum degree condition for proper connection number 2 (Q2424876):
Displaying 8 items.
- Properly colored trails, paths, and bridges (Q1702827) (← links)
- Graphs with conflict-free connection number two (Q1756118) (← links)
- Minimum degree and size conditions for the proper connection number of graphs (Q2010690) (← links)
- Digraphs with proper connection number two (Q2034401) (← links)
- Hardness results for three kinds of colored connections of graphs (Q2202016) (← links)
- On two conjectures about the proper connection number of graphs (Q2359964) (← links)
- The fine-grained complexity of approximately counting proper connected colorings (extended abstract) (Q6606223) (← links)
- List proper connection of 2-edge-connected graphs (Q6644889) (← links)