Embedding connected double-loop networks with even cardinality in books (Q1033043): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: On the pagenumber of complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding the incomplete hypercube in books / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum embedding of complete graphs in books / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for finding the pagenumber of interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Crossing Sets, Disjoint Sets, and Pagenumber / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pagenumber of the class of bandwidth-k graphs is \(k-1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree constrained book embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complementary survey on double-loop networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank

Latest revision as of 03:43, 2 July 2024

scientific article
Language Label Description Also known as
English
Embedding connected double-loop networks with even cardinality in books
scientific article

    Statements