On the page number of complete odd-partite graphs

DOI10.1016/j.disc.2013.04.028zbMath1277.05073OpenAlexW2016927512WikidataQ56689190 ScholiaQ56689190MaRDI QIDQ383683

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

zbMATH Keywords

edge-coloringbook embeddingbook thicknesscomplete multipartite graphspage number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Embedding generalized Petersen graph in books ⋮ Inducibility and universality for trees ⋮ A survey on book-embedding of planar graphs ⋮ Minimum Number of Monotone Subsequences of Length 4 in Permutations ⋮ A note on the inducibility of 4-vertex graphs ⋮ Book embedding of complex network with community structure ⋮ Inducibility of \(d\)-ary trees

Cites Work

• The book thickness of a graph
• On the pagenumber of complete bipartite graphs
• Pagenumber of complete bipartite graphs
• Unnamed Item

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