Planarity for clustered graphs (Q6102302): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-60313-1_145 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1487870695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for embedding planar graphs using PQ-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Depth-First-Search Characterization of Planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing an st-numbering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs: Theory and algorithms / rank
 
Normal rank

Latest revision as of 02:02, 1 August 2024

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

    Statements

    Identifiers