König-Egerváry graphs, 2-bicritical graphs and fractional matchings (Q1825210): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Node-weighted graphs having the König-Egerváry property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of graphs - an extension of the Koenig-Egervary theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertices Belonging to All or to No Maximum Stable Sets of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ear-decompositions of matching-covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the integer-valued variables in the linear vertex packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum node covers and 2-bicritical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4078069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the graphs in which the transversal number equals the matching number / rank
 
Normal rank

Revision as of 10:12, 20 June 2024

scientific article
Language Label Description Also known as
English
König-Egerváry graphs, 2-bicritical graphs and fractional matchings
scientific article

    Statements

    Identifiers