The following pages link to The deficiency of a regular graph (Q2501566):
Displaying 14 items.
- The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class (Q279204) (← links)
- A comparison of integer and constraint programming models for the deficiency problem (Q342299) (← links)
- On resistance of graphs (Q643030) (← links)
- On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic (Q666002) (← links)
- Lower bounds and a tabu search algorithm for the minimum deficiency problem (Q841600) (← links)
- On the structure and deficiency of \(k\)-trees with bounded degree (Q908291) (← links)
- Interval edge-colorings of complete graphs and \(n\)-dimensional cubes (Q968437) (← links)
- On the deficiency of bipartite graphs (Q1293200) (← links)
- Cyclic deficiency of graphs (Q2026336) (← links)
- Further results on the deficiency of graphs (Q2357781) (← links)
- Symmetry Breaking Constraints for the Minimum Deficiency Problem (Q2971392) (← links)
- (Q4017181) (← links)
- Integer programming formulations for minimum deficiency interval coloring (Q4686679) (← links)
- Sufficient conditions for Hamiltonian properties of graphs based on the difference of Zagreb indices (Q6616149) (← links)
