Polynomial time recognition of unit circular-arc graphs

2006 ◽  
Vol 58 (1) ◽  
pp. 67-78 ◽  
Author(s):  
Guillermo Durán ◽  
Agustín Gravano ◽  
Ross M. McConnell ◽  
Jeremy Spinrad ◽  
Alan Tucker
2019 ◽  
Author(s):  
Leandro M. Zatesko ◽  
Renato Carmo ◽  
André L. P. Guedes

We present a novel recolouring procedure for graph edge-colouring. We show that all graphs whose vertices have local degree sum not too large can be optimally edge-coloured in polynomial time. We also show that the set ofthe graphs satisfying this condition includes almost every graph (under the uniform distribution). We present further results on edge-colouring join graphs, chordal graphs, circular-arc graphs, and complementary prisms, whose proofs yield polynomial-time algorithms. Our results contribute towards settling the Over- full Conjecture, the main open conjecture on edge-colouring simple graphs. Fi- nally, we also present some results on total colouring.


2018 ◽  
Vol 35 (1) ◽  
pp. 739-748 ◽  
Author(s):  
Sk. Amanathulla ◽  
Madhumangal Pal

1981 ◽  
Vol 2 (2) ◽  
pp. 88-93 ◽  
Author(s):  
James B. Orlin ◽  
Maurizio A. Bonuccelli ◽  
Daniel P. Bovet

2014 ◽  
Vol 164 ◽  
pp. 427-443 ◽  
Author(s):  
Guillermo Durán ◽  
Luciano N. Grippo ◽  
Martín D. Safe

Sign in / Sign up

Export Citation Format

Share Document