Optimal packing of induced stars in a graph (Q1367032): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On factors with given components / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An extension of matching theory / 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: On the Complexity of General Graph Factor Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packings by Complete Bipartite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4141828 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4303878 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An extension of Tutte's 1-factor theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On matroids induced by packing subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3972010 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient subgraphs packing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4111952 / rank | |||
Normal rank |
Latest revision as of 18:55, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal packing of induced stars in a graph |
scientific article |
Statements
Optimal packing of induced stars in a graph (English)
0 references
28 April 1998
0 references
A subset \(A\) of the edge set of a graph \(G\) is called an induced \(n\)-star packing of \(G\) if every component of the subgraph of \(G\) induced by \(A\) is a star with at most \(n\) edges. The author considers the problem of finding an induced star packing of \(G\) that covers the maximum number of vertices. This problem is a generalization of the classical matching problem. He proves that many fundamental results on matchings can be extended to induced \(n\)-star packings.
0 references
packing
0 references
induced star
0 references