Embedding Spanning Bipartite Graphs of Small Bandwidth (Q4903263): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized embedding algorithm for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian degree sequences in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type Theorem for Perfect Packings in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate version of Sumner's universal tournament conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Alon-Yuster conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Blow-up Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type theorem on equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth theorem for random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton's ideals / 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: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing \(d\)-degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding well-separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing spanning subgraphs via Ore type conditions / rank
 
Normal rank

Revision as of 03:23, 6 July 2024

scientific article; zbMATH DE number 6127311
Language Label Description Also known as
English
Embedding Spanning Bipartite Graphs of Small Bandwidth
scientific article; zbMATH DE number 6127311

    Statements

    Embedding Spanning Bipartite Graphs of Small Bandwidth (English)
    0 references
    0 references
    0 references
    21 January 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    minimum degree of a graph
    0 references
    degree sequence of a graph
    0 references
    0 references