Tight isolated toughness bound for fractional \((k, n)\)-critical graphs (Q2081483): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Wei Fan Wang / rank
Normal rank
 
Property / author
 
Property / author: Wei Fan Wang / rank
 
Normal rank
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.2022.08.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4295981808 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114191367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New isolated toughness condition for fractional $(g,f,n)$-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On toughness and fractional \((g,f,n)\)-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and the existence of fractional \(k\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3431166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2765142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4957932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On path-factor critical deleted (or covered) graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence number and connectivity for fractional (<i>a</i>, <i>b</i>, <i>k</i>)-critical covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS / rank
 
Normal rank

Latest revision as of 10:33, 30 July 2024

scientific article
Language Label Description Also known as
English
Tight isolated toughness bound for fractional \((k, n)\)-critical graphs
scientific article

    Statements

    Identifiers