Some existence theorems on path factors with given properties in graphs (Q2199110): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q126320523, #quickstatements; #temporary_batch_1722360600149
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10114-020-9224-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2999068088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3910557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On path factors of \((3,4)\)-biregular bigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameters and fractional factors in different settings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A toughness condition for fractional \((k, m)\)-deleted graphs revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path factors and parallel knock-out schemes of almost claw-free graphs / 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: Packing paths of length at least two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path and cycle factors of cubic bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component factors with large components in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path factors in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF <i>k</i>-FACTORS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing 3-vertex paths in claw-free graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sum conditions for path-factors with specified end vertices in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness, binding number and restricted matching extension in a graph / 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: A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding numbers for fractional ID-\(k\)-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on orthogonal factorizations of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on path factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new sufficient conditions for graphs to have fractional<i>k</i>-factors / 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: A toughness condition for fractional \((k,m)\)-deleted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of \(P_{\geq3}\)-factor covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for fractional \((a,b,k)\)-critical covered graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126320523 / rank
 
Normal rank

Latest revision as of 19:33, 30 July 2024

scientific article
Language Label Description Also known as
English
Some existence theorems on path factors with given properties in graphs
scientific article

    Statements

    Some existence theorems on path factors with given properties in graphs (English)
    0 references
    0 references
    0 references
    16 September 2020
    0 references
    binding number, \(P_{\geq 2}\)-factor, \(P_{\geq 3}\)-factor, \((P_{\geq 2}, k)\)-factor-critical covered graph, \((P_{\geq 3}, k)\)-factor-critical covered graph
    0 references
    0 references

    Identifiers