Problems on matchings and independent sets of a graph (Q1744740): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2793542804 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1701.03040 / 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: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical and maximum independent sets of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5441574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties of the family of maximum stable sets of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical independent sets and König-Egerváry graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertices Belonging to All Critical Sets of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical sets in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of the minimum critical independent set of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the intersection of all critical sets of a unicyclic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some conjectures concerning critical independent sets of a graph / 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
Property / cites work
 
Property / cites work: Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:27, 15 July 2024

scientific article
Language Label Description Also known as
English
Problems on matchings and independent sets of a graph
scientific article

    Statements

    Problems on matchings and independent sets of a graph (English)
    0 references
    0 references
    0 references
    0 references
    19 April 2018
    0 references
    independent set
    0 references
    critical set
    0 references
    matching
    0 references
    unicyclic graph
    0 references
    König-Egerváry graph
    0 references

    Identifiers