A note on extremal results on directed acyclic graphs
From MaRDI portal
Publication:4577882
Abstract: The family of Directed Acyclic Graphs as well as some related graphs are analyzed with respect to extremal behavior in relation with the family of intersection graphs for families of boxes with transverse intersection.
Recommendations
- Extremal problems for directed graphs
- On some extremal problems in graph theory
- Some new results in extremal graph theory
- scientific article; zbMATH DE number 3222643
- Extremal results for directed tree connectivity
- scientific article; zbMATH DE number 2170455
- On extremal problems of graphs and generalized graphs
- Publication:5753977
- On a problem in extremal graph theory
- On some variations of extremal graph problems
Cites work
Cited in
(5)- Directed acyclic graphs with the unique dipath property
- Some remarks on Ádám's conjecture for simple directed graphs
- Counting acyclic orderings in directed acyclic graphs
- A note on maximal common subgraphs of the Dirac's family of graphs
- Effects of adding a reverse edge across a stem in a directed acyclic graph
This page was built for publication: A note on extremal results on directed acyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4577882)