The mixed page number of graphs
Authors:
- Jawaherul Md. AlamJAJawaherul Md. Alam
- Michael A. BekosMBMichael A. Bekos
- Martin GronemannMGMartin Gronemann
- Michael KaufmannMKMichael Kaufmann
- Sergey PupyrevSPSergey Pupyrev
- 2 August 2022
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 931, 131-141
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- The pagenumber of k-trees is O(k)Discrete Applied Mathematics, 2001
- On the Pagenumber of Complete Bipartite GraphsJournal of Combinatorial Theory, Series B, 1997
- Graphs with E Edges Have Pagenumber O(√E)Journal of Algorithms, 1994
- Laying Out Graphs Using QueuesSIAM Journal on Computing, 1992
- Comparing Queues and Stacks As Machines for Laying Out GraphsSIAM Journal on Discrete Mathematics, 1992
- Embedding planar graphs in four pagesJournal of Computer and System Sciences, 1989
- Graph minors. I. Excluding a forestJournal of Combinatorial Theory, Series B, 1983
- The bandwidth problem for graphs and matrices—a surveyJournal of Graph Theory, 1982
- The book thickness of a graphJournal of Combinatorial Theory, Series B, 1979
- Optimal Linear OrderingSIAM Journal on Applied Mathematics, 1973