Two-page book embeddings of 4-planar graphs (Q300468): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2100223096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The book thickness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Any maximal planar graph with only one separating triangle is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Each maximal planar graph with exactly two separating triangles is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of a theorem of Whitney / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding planar graphs in four pages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:31, 12 July 2024

scientific article
Language Label Description Also known as
English
Two-page book embeddings of 4-planar graphs
scientific article

    Statements