Pages that link to "Item:Q1386481"

The following pages link to On the pagenumber of complete bipartite graphs (Q1386481):

Displaying 23 items.

• Embedding generalized Petersen graph in books (Q295940) (← links)
• On the page number of complete odd-partite graphs (Q383683) (← links)
• Counting links in complete graphs (Q1012051) (← links)
• Embedding connected double-loop networks with even cardinality in books (Q1033043) (← links)
• Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph (Q1304472) (← links)
• The book thickness of nilpotent graphs (Q2136363) (← links)
• A survey on book-embedding of planar graphs (Q2141323) (← links)
• Linear layouts of complete graphs (Q2151449) (← links)
• The mixed page number of graphs (Q2167907) (← links)
• Embedding planar 5-graphs in three pages (Q2185736) (← links)
• Local and union page numbers (Q2206876) (← links)
• Book embedding of complex network with community structure (Q2279645) (← links)
• Book drawings of complete bipartite graphs (Q2440102) (← links)
• Book embedding of locally planar graphs on orientable surfaces (Q2629277) (← links)
• On the Page Number of Upward Planar Directed Acyclic Graphs (Q3223971) (← links)
• Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings (Q3439389) (← links)
• Upward Partitioned Book Embeddings (Q4625113) (← links)
• Upward Book Embeddings of st-Graphs (Q5088940) (← links)
• Book Embedding of Graphs on the Projective Plane (Q5237910) (← links)
• Book Embeddings of Regular Graphs (Q5254031) (← links)
• Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
• The matching book embeddings of pseudo-Halin graphs (Q6109796) (← links)
• Using Euler’s Formula to Find the Lower Bound of the Page Number (Q6489355) (← links)