Planarity for clustered graphs (Q6102302)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7683197

Language	Label	Description	Also known as
English	Planarity for clustered graphs	scientific article; zbMATH DE number 7683197

Statements

scholarly article

0 references

Planarity for clustered graphs (English)

0 references

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

8 May 2023

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/3-540-60313-1_145

0 references

0 references

0 references

Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

0 references

A linear algorithm for embedding planar graphs using PQ-trees

0 references

A Depth-First-Search Characterization of Planarity

0 references

Computing an st-numbering

0 references

Crossing Number is NP-Complete

0 references

Efficient Planarity Testing

0 references

0 references

Planar graphs: Theory and algorithms

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/3-540-60313-1_145

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6102302

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6102302&oldid=37514185"