Neighbourhood conditions for fractional ID-[a,b]-factor-critical graphs
From MaRDI portal
Publication:5031076
DOI10.2298/PIM1715205YzbMATH Open1499.05531MaRDI QIDQ5031076FDOQ5031076
Authors: Yuan Yuan, Zhiren Sun 
Publication date: 18 February 2022
Published in: Publications de l'Institut Math?matique (Belgrade) (Search for Journal in Brave)
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs
- A result on fractional ID-\([a,b]\)-factor-critical graphs
- Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
- A sufficient condition for fractional ID-\([a,b]\)-factor-critical covered graphs
- A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
fractional \([a, b\)-factor]fractional ID-\([a, b\)-factor-critical graph]neighbourhood condition
Cites Work
- Graph theory
- A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS
- Fractional \((g,f)\)-factors of graphs
- Neighborhood conditions and fractional \(k\)-factors
- Fan-type results for the existence of [\(a\),\(b\)]-factors
- Binding numbers and connected factors
- Binding numbers and \([a,b]\)-factors excluding a given \(k\)-factor
- Toughness of graphs and the existence of factors
- A sufficient condition for a graph to have \([a,b]\)-factors
- Title not available (Why is that?)
- Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs
- Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
- Neighbourhood and the existence of fractional \(k\)-factors of graphs
Cited In (1)
This page was built for publication: Neighbourhood conditions for fractional ID-\([a,b]\)-factor-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5031076)
