Tree 3-spanners on interval, permutation and regular bipartite graphs (Q671393): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q126588256, #quickstatements; #temporary_batch_1721934265115
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(96)00078-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988646256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spanning 2-trees in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to domination problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126588256 / rank
 
Normal rank

Latest revision as of 21:04, 25 July 2024

scientific article
Language Label Description Also known as
English
Tree 3-spanners on interval, permutation and regular bipartite graphs
scientific article

    Statements

    Tree 3-spanners on interval, permutation and regular bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    Tree t-spanner
    0 references
    Interval graph
    0 references
    Permutation graph
    0 references
    Regular bipartite graph
    0 references
    0 references
    0 references