Publication | Closed Access
Total colouring regular bipartite graphs is NP-hard
70
Citations
6
References
1994
Year
EngineeringGraph TheoryExtremal Graph TheoryStructural Graph TheoryRegular Bipartite GraphsComputational ComplexityExtremal CombinatoricsDiscrete MathematicsCombinatorial Optimization
| Year | Citations | |
|---|---|---|
Page 1
Page 1