The following pages link to Cyclic deficiency of graphs (Q2026336):
Displaying 8 items.
- A comparison of integer and constraint programming models for the deficiency problem (Q342299) (← links)
- Lower bounds and a tabu search algorithm for the minimum deficiency problem (Q841600) (← links)
- Further results on the deficiency of graphs (Q2357781) (← links)
- The deficiency of a regular graph (Q2501566) (← links)
- Integer programming formulations for minimum deficiency interval coloring (Q4686679) (← links)
- Graphs omitting a finite set of cycles (Q4875691) (← links)
- Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules (Q6041828) (← links)
- Sufficient conditions for Hamiltonian properties of graphs based on the difference of Zagreb indices (Q6616149) (← links)