Adamant digraphs

DOI10.1016/0012-365X(88)90054-4MaRDI QIDQ1104933zbMATH OpenOpenAlexFDO

Authors Paola Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(88)90054-4

zbMATH Keywords

recognition algorithmsadamant digraphsFerrers digraphsinflexible digraphsseries-parallel digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• scientific article; zbMATH DE number 5379347
• Perfect digraphs
• Antistrong digraphs
• Highly irregular digraphs
• Eccentric digraphs
• Chordal digraphs
• Chordal digraphs
• Supereulerian digraphs
• scientific article; zbMATH DE number 1092941
• Well primitive digraphs

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• scientific article; zbMATH DE number 3598234 (Why is no real title available?)
• scientific article; zbMATH DE number 3064989 (Why is no real title available?)
• Ferrers digraphs and threshold graphs
• Scheduling Interval-Ordered Tasks
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• The Recognition of Series Parallel Digraphs

Cited in

(1)

• scientific article; zbMATH DE number 5379347 (Why is no real title available?)

This page was built for publication: Adamant digraphs

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