Globally bi-3*-connected graphs (Q1025446): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2760442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge fault tolerance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic planar Hamiltonian graphs of various types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Christmas tree: a versatile 1-fault-tolerant design for token rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spanning connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spanning connectivity and spanning laceability of hypercube-like networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian graphs with minimum number of edges for fault-tolerant topologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The globally bi-\(3^{*}\)-connected property of the honeycomb rectangular torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal 1-Hamiltonian graphs / rank
 
Normal rank

Latest revision as of 17:09, 1 July 2024

scientific article
Language Label Description Also known as
English
Globally bi-3*-connected graphs
scientific article

    Statements

    Globally bi-3*-connected graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 June 2009
    0 references
    0 references
    connectivity
    0 references
    Menger's theorem
    0 references
    Hamiltonian
    0 references
    0 references