Minimal graphs for 2-factor extension (Q2185731): 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 / 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.dam.2019.11.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2997755348 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126426941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of matching extensions in graphs. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal graphs for matching extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending matchings in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to 2-factors in bipartite graphs / rank
 
Normal rank

Latest revision as of 21:34, 22 July 2024

scientific article
Language Label Description Also known as
English
Minimal graphs for 2-factor extension
scientific article

    Statements