Strict chordal digraphs viewed as graphs with distinguished edges

DOI10.1016/J.DAM.2018.03.061zbMATH Open1394.05039OpenAlexW2797483167WikidataQ130005924 ScholiaQ130005924MaRDI QIDQ1671322FDOQ1671322

Authors: 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

Recommendations

• Chordal digraphs
• Chordal digraphs
• Split digraphs
• Chordality of locally semicomplete and weakly quasi-transitive digraphs
• Heroes in orientations of chordal graphs

zbMATH Keywords

split graphchordal graphclique treestrict chordal digraphstrict split digraph

Mathematics Subject Classification ID

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

Cites Work

• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• Efficient graph representations
• Strict chordal and strict split digraphs
• Title not available (Why is that?)

Cited In (2)

• Chordal digraphs
• Semi-strict chordality of digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671322)