The relation of matching with inverse degree of a graph (Q2581633): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GRAFFITI / rank
 
Normal rank
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/j.disc.2003.01.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048097807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conjectures of Graffiti / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank

Latest revision as of 14:58, 11 June 2024

scientific article
Language Label Description Also known as
English
The relation of matching with inverse degree of a graph
scientific article

    Statements

    The relation of matching with inverse degree of a graph (English)
    0 references
    10 January 2006
    0 references
    0 references
    Counterexample
    0 references
    Graffiti's conjecture
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references