Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs (Q976141): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56766816 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2131867452 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0910.3014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse universal graphs for bounded‐degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Nonplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Graphs for Bounded-Degree Trees and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the bandwidth conjecture of Bollobás and Komlós / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small universal graphs for bounded-degree planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinct distances in graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph drawings with few slopes / 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: On tree width, bramble size, and expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Blow-up Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding large subgraphs into dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large planar subgraphs in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. VI. Disjoint paths across a disc / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:57, 2 July 2024

scientific article
Language Label Description Also known as
English
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
scientific article

    Statements

    Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 June 2010
    0 references
    0 references
    size of a separator of a grph
    0 references
    0 references
    0 references
    0 references