Abstract
P. Hell and C. Hernández-Cruz recently defined new directed graph analogs of the traditional concepts of chordal and split graphs. This paper will provide additional evidence of the naturalness of their digraph analogs using characterizations in terms of undirected graphs with distinguished edges, most notably using standard clique tree representations from chordal graph theory.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
