A diameter-revealing proof of the Bondy-Lovász lemma (Q2059880): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3194061904 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124818246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homology theory for spanning tress of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Almost) Tight bounds and existence theorems for single-commodity confluent flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication in m-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing an st-numbering / rank
 
Normal rank
Property / cites work
 
Property / cites work: st-ordering the vertices of biconnected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3719851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411363 / rank
 
Normal rank

Latest revision as of 13:17, 27 July 2024

scientific article
Language Label Description Also known as
English
A diameter-revealing proof of the Bondy-Lovász lemma
scientific article

    Statements

    A diameter-revealing proof of the Bondy-Lovász lemma (English)
    0 references
    0 references
    0 references
    14 December 2021
    0 references
    Bondy-Lovász lemma
    0 references
    Győri-Lovász theorem
    0 references
    graph diameter
    0 references
    graph partitioning
    0 references
    graph algorithms
    0 references

    Identifiers