On the page number of complete odd-partite graphs

DOI10.1016/J.DISC.2013.04.028zbMATH Open1277.05073OpenAlexW2016927512WikidataQ56689190 ScholiaQ56689190MaRDI QIDQ383683FDOQ383683

Authors: Konrad Sperfeld 

Publication date: 5 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.04.028

Recommendations

• Pagenumber of complete bipartite graphs
• On the pagenumber of complete bipartite graphs
• scientific article; zbMATH DE number 6902663
• Book drawings of complete bipartite graphs
• Optimum embedding of complete graphs in books

zbMATH Keywords

book thicknessedge-coloringcomplete multipartite graphsbook embeddingpage number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• The book thickness of a graph
• On the pagenumber of complete bipartite graphs
• Pagenumber of complete bipartite graphs
• Title not available (Why is that?)

Cited In (14)

• Pagenumber of pathwidth-\(k\) graphs and strong pathwidth-\(k\) graphs
• Book drawings of complete bipartite graphs
• Embedding generalized Petersen graph in books
• A survey on book-embedding of planar graphs
• Inducibility of \(d\)-ary trees
• On the book embedding of ordered sets.
• The pagenumber of toroidal graphs is at most seven
• On the page number of triple-loop networks with even cardinality.
• Pagenumber of complete bipartite graphs
• Book embedding of complex network with community structure
• Minimum Number of Monotone Subsequences of Length 4 in Permutations
• A note on the inducibility of 4-vertex graphs
• Book embedding of toroidal bipartite graphs
• Inducibility and universality for trees

This page was built for publication: On the page number of complete odd-partite graphs

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