A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs (Q1617028): 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.1007/s10255-018-0786-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2895001549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and factorizations of graphs. Proof techniques in factor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions of fractional ID-\(k\)-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of \(k\)-factors in squares of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient condition for the existence of an even \([a,b]\)-factor in graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2870965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional \((g,f)\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified existence theorems on all fractional \([a,b]\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore‐type condition for the existence of connected factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs / rank
 
Normal rank

Revision as of 06:33, 17 July 2024

scientific article
Language Label Description Also known as
English
A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
scientific article

    Statements

    A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs (English)
    0 references
    0 references
    0 references
    7 November 2018
    0 references
    graph
    0 references
    minimum degree
    0 references
    neighborhood
    0 references
    fractional \([a, b]\)-factor
    0 references
    fractional ID-\([a, b]\)-factor-critical
    0 references

    Identifiers