The following pages link to (Q5689006):
Displayed 9 items.
- Eulerian colorings and the bipartizing matchings conjecture of Fleischner (Q852699) (← links)
- Flows, flow-pair covers and cycle double covers (Q1044934) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- An algorithm for identifying cycle-plus-triangles graphs (Q2357769) (← links)
- 3-colorability of 4-regular hamiltonian graphs (Q4797925) (← links)
- An asymptotic bound for the strong chromatic number (Q5222554) (← links)
- Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings (Q6081880) (← links)
- On finding constrained independent sets in cycles (Q6130317) (← links)
- Partitioning into common independent sets via relaxing strongly base orderability (Q6144384) (← links)