Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs (Q2234788): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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.ipl.2021.106162 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3182225709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research on fractional critical covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its Anderson number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results about component factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on path factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding numbers and restricted fractional \(( g , f )\)-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5065860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some existence theorems on path factors with given properties in graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:16, 26 July 2024

scientific article
Language Label Description Also known as
English
Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
scientific article

    Statements

    Identifiers