On two extensions of equimatchable graphs (Q1751251): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On three extensions of equimatchable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in polytopal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching-perfect and cover-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equimatchable factor‐critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two equimatchable graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the size of equimatchable graphs of fixed genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient recognition of equimatchable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equimatchable Graphs on Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum maximal distance-\(k\) matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal graphs for matching extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of well-covered graphs and the complexity of their recognition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank

Latest revision as of 16:09, 15 July 2024

scientific article
Language Label Description Also known as
English
On two extensions of equimatchable graphs
scientific article

    Statements

    On two extensions of equimatchable graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    minimum maximal matching
    0 references
    equimatchable graph
    0 references
    edge dominating set
    0 references
    Gallai-Edmonds decomposition
    0 references
    parameterized complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references