Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs

1995 ◽  
Vol 20 (3) ◽  
pp. 361-374 ◽  
Author(s):  
Pavon Hell ◽  
Jing Huang
2018 ◽  
Author(s):  
João Pedro W. Bernardi ◽  
Sheila M. De Almeida ◽  
Leandro M. Zatesko

Deciding if a graph is Δ-edge-colourable (resp. (Δ + 1)-total colourable), although it is an NP-complete problem for graphs in general, is polynomially solvable for interval graphs of odd (resp. even) maximum degree Δ. An interesting superclass of the proper interval graphs are the proper circular-arc graphs, for which we suspect that Δ-edge-colourability is linear-time decidable. This work presents sufficient conditions for Δ-edge-colourability, (Δ + 1)-total colourability, and (Δ+2)-total colourability of proper circular-arc graphs. Our proofs are constructive and yield polynomial-time algorithms.


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

2019 ◽  
Vol 346 ◽  
pp. 125-133
Author(s):  
João Pedro W. Bernardi ◽  
Murilo V.G. da Silva ◽  
André Luiz P. Guedes ◽  
Leandro M. Zatesko

Networks ◽  
1982 ◽  
Vol 12 (4) ◽  
pp. 459-467 ◽  
Author(s):  
U. I. Gupta ◽  
D. T. Lee ◽  
J. Y.-T. Leung

1994 ◽  
Vol 128 (1-3) ◽  
pp. 395-398 ◽  
Author(s):  
Jørgen Bang-Jensen ◽  
Pavol Hell

Sign in / Sign up

Export Citation Format

Share Document