Note on the bisection width of cubic graphs (Q2197453): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Edge-Expansion of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions for cubic graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bisection width of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks communicating for each pairing of terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-regular path pairable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on terminal-pairability in complete grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Terminal-Pairability in Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linkage on the infinite grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum size of graphs satisfying cut conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the bisection width of 3- and 4-regular graphs / rank
 
Normal rank

Latest revision as of 10:35, 23 July 2024

scientific article
Language Label Description Also known as
English
Note on the bisection width of cubic graphs
scientific article

    Statements

    Note on the bisection width of cubic graphs (English)
    0 references
    0 references
    0 references
    0 references
    31 August 2020
    0 references
    bisection width
    0 references
    even cut condition
    0 references
    cubic and subcubic graphs
    0 references
    communication networks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references