Unraveling k-page graphs

DOI10.1016/S0019-9958(85)80008-5MaRDI QIDQ3708844zbMATH OpenOpenAlexFDO

Authors R. Kannan

Publication date 1985

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(85)80008-5

zbMATH Keywords

page graphseparable family of graphsseparatorTuring machines

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• Unravelling tangled graphs
• Graph fibrations, graph isomorphism, and PageRank
• Untangling a planar graph
• Untangling a Planar Graph
• scientific article; zbMATH DE number 4162923
• On the pagenumber of \(k\)-trees
• On the pagenumber of complete bipartite graphs
• scientific article; zbMATH DE number 1507238
• scientific article; zbMATH DE number 4099351
• A generalization of Kneser graphs

Cited in

(6)

• The toroidal splitting number of the complete graph \(K_ n\)
• On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines
• On 3-pushdown graphs with large separators
• Layouts of Expander Graphs
• Characterisations and examples of graph classes with bounded expansion
• On the stack layouts of toroidal grids

This page was built for publication: Unraveling k-page graphs

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