Strict chordal digraphs viewed as graphs with distinguished edges

DOI10.1016/j.dam.2018.03.061zbMath1394.05039OpenAlexW2797483167WikidataQ130005924 ScholiaQ130005924MaRDI QIDQ1671322

Terry A. McKee

Publication date: 6 September 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.061

zbMATH Keywords

split graphchordal graphclique treestrict chordal digraphstrict split digraph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Strict chordal and strict split digraphs
• Efficient graph representations
• Topics in Intersection Graph Theory
• Graph Classes: A Survey

This page was built for publication: Strict chordal digraphs viewed as graphs with distinguished edges