A Separator Theorem for String Graphs and its Applications (Q3058296): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Generalized Nested Dissection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On planar intersection graphs with forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological graphs with no large grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper minor-closed families are small / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring relatives of intervals on the plane. I: Chromatic number versus girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing number, pair-crossing number, and expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A separator theorem for graphs of bounded genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separator theorems and Turán-type results for planar intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Turán-type theorem on chords of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bipartite analogue of Dilworth's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth, treewidth, separators, expansion, and universality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Nonplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separators for sphere-packings and nearest neighbor graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Girth in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which crossing number is it anyway? / rank
 
Normal rank

Latest revision as of 12:30, 3 July 2024

scientific article
Language Label Description Also known as
English
A Separator Theorem for String Graphs and its Applications
scientific article

    Statements

    A Separator Theorem for String Graphs and its Applications (English)
    0 references
    0 references
    0 references
    19 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    string graph
    0 references
    intersection graph
    0 references
    locally tree-like string graphs
    0 references