A note on graphs contraction-critical with respect to independence number (Q2449144): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2014.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075725852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4208001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Hamiltonian bicubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Core of a Graph<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with unique maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in 2-connected regular bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4305231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on contractible edges in graphs of a prescribed vertex connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractions, cycle double covers, and cyclic colorings in locally connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On defect-d matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: WELL-COVERED GRAPHS: A SURVEY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3656223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390609 / rank
 
Normal rank

Latest revision as of 11:28, 8 July 2024

scientific article
Language Label Description Also known as
English
A note on graphs contraction-critical with respect to independence number
scientific article

    Statements

    A note on graphs contraction-critical with respect to independence number (English)
    0 references
    0 references
    0 references
    6 May 2014
    0 references
    independent set
    0 references
    contraction-critical
    0 references
    matching
    0 references
    1-extendable
    0 references
    polynomial algorithm
    0 references

    Identifiers