Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (Q1014835): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Factors and factorizations of graphs—a survey / 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: Path factors in cubic graphs / 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: How many disjoint 2-edge paths must a cubic graph have? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3070345 / rank | |||
Normal rank |
Latest revision as of 13:13, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph |
scientific article |
Statements
Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (English)
0 references
29 April 2009
0 references
path matching
0 references
three-vertex path
0 references
cubic graph
0 references