Dualities in graphs and digraphs

DOI10.14279/DEPOSITONCE-16147MaRDI QIDQ6631265zbMATH OpenFDO

Authors Meike Hatzel

Publication date 1 November 2024

Published in Foundations of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14279/DEPOSITONCE-16147

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Perfect graphs (05C17) Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Are there any good digraph width measures?
• Digraphs of bounded width
• Are there any good digraph width measures?
• Mathematical Foundations of Computer Science 2005
• Unifying duality theorems for width parameters in graphs and matroids (extended abstract)

This page was built for publication: Dualities in graphs and digraphs

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