On the pagenumber of complete bipartite graphs

DOI10.1006/jctb.1997.1773zbMath0902.05019OpenAlexW2051344921WikidataQ29400532 ScholiaQ29400532MaRDI QIDQ1386481

Tomoki Nakamigawa, Hikoe Enomoto, Katsuhiro Ota

Publication date: 24 May 1998

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1997.1773

zbMATH Keywords

bookembeddingcomplete bipartite graphpagenumber

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Embedding generalized Petersen graph in books, The book thickness of nilpotent graphs, Book embedding of locally planar graphs on orientable surfaces, A survey on book-embedding of planar graphs, Linear layouts of complete graphs, The mixed page number of graphs, On the page number of complete odd-partite graphs, Embedding planar 5-graphs in three pages, On the Page Number of Upward Planar Directed Acyclic Graphs, Upward book embeddability of \(st\)-graphs: complexity and algorithms, The matching book embeddings of pseudo-Halin graphs, Local and union page numbers, Book drawings of complete bipartite graphs, Upward Partitioned Book Embeddings, Book embedding of complex network with community structure, Counting links in complete graphs, Upward Book Embeddings of st-Graphs, Embedding connected double-loop networks with even cardinality in books, Book Embedding of Graphs on the Projective Plane, Book Embeddings of Regular Graphs, Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph, Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings

Cites Work

• The book thickness of a graph
• Pagenumber of complete bipartite graphs