PARTITIONS OF COMPLETE BIPARTITE GEOMETRIC GRAPHS INTO PLANE PERFECT MATCHINGS (Q5237541): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q128454902, #quickstatements; #temporary_batch_1722802475495
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The book thickness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of complete geometric graphs into plane trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing trees into planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of the number of disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.17654/ms110010041 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2914837293 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128454902 / rank
 
Normal rank

Latest revision as of 21:20, 4 August 2024

scientific article; zbMATH DE number 7119485
Language Label Description Also known as
English
PARTITIONS OF COMPLETE BIPARTITE GEOMETRIC GRAPHS INTO PLANE PERFECT MATCHINGS
scientific article; zbMATH DE number 7119485

    Statements

    PARTITIONS OF COMPLETE BIPARTITE GEOMETRIC GRAPHS INTO PLANE PERFECT MATCHINGS (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 2019
    0 references
    geometric graphs
    0 references
    partitioning
    0 references
    perfect matching
    0 references

    Identifiers