On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/s10878-021-00708-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3126482586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and factorizations of graphs—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar 3DM is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching and weighted \(P_2\)-packing: algorithms and kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parameterized perspective on packing paths of length two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packings by cliques and by finite families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packings by Complete Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On packing 3-vertex paths in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many disjoint 2-edge paths must a cubic graph have? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packingk-edge trees in graphs of restricted vertex degrees / 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: On the Complexity of General Graph Factor Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Processing and Applied Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path partition problem and related problems in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking at the stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved kernelization for \(P_{2}\)-packing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:03, 25 July 2024

scientific article
Language Label Description Also known as
English
On maximum \(P_3\)-packing in claw-free subcubic graphs
scientific article

    Statements

    On maximum \(P_3\)-packing in claw-free subcubic graphs (English)
    0 references
    0 references
    0 references
    11 May 2021
    0 references
    (2,3)-regular graph
    0 references
    subcubic graph
    0 references
    claw-free graph
    0 references
    \(P_3\)-packing
    0 references
    perfect \(P_3\)-packing
    0 references
    0 references
    0 references
    0 references

    Identifiers