Abstract
A graph is a P 4 -comparability graph if it admits an acyclic orientation of its edges which is transitive on every chordless path on four vertices. We give a characterization of P 4 -comparability graphs in terms of an auxiliary graph being bipartite.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
