Neighborhood union conditions for fractional [a, b]-covered graphs
From MaRDI portal
Publication:2302016
DOI10.1007/S40840-018-0669-YzbMATH Open1433.05264OpenAlexW2890081110MaRDI QIDQ2302016FDOQ2302016
Publication date: 25 February 2020
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-018-0669-y
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- Title not available (Why is that?)
- A neighbourhood condition for graphs to have \([a,b]\)-factors
- Neighborhood conditions and fractional \(k\)-factors
- Title not available (Why is that?)
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph
- Title not available (Why is that?)
- A result on \(r\)-orthogonal factorizations in digraphs
- Remarks on orthogonal factorizations of digraphs
- Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
- Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
- A degree condition for a graph to have \((a,b)\)-parity factors
- Degree conditions for graphs to be fractional \(k\)-covered graphs.
Cited In (5)
- Spectral radius conditions for fractional \([a,b]\)-covered graphs
- Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors
- Research on fractional critical covered graphs
- A degree condition for fractional \([a,b]\)-covered graphs
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
This page was built for publication: Neighborhood union conditions for fractional \([a, b]\)-covered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302016)
