Determination of the star valency of a graph (Q1861579): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q215558 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Peter Horák / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Covering a graph by complete bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bipartite dimensions and bipartite degrees of graphs / rank | |||
Normal rank | |||
Latest revision as of 12:23, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determination of the star valency of a graph |
scientific article |
Statements
Determination of the star valency of a graph (English)
0 references
9 March 2003
0 references
A star decomposition \(P\) of a graph \(G\) is a decomposition of the edge set of \(G\) into stars. Let \(M(P)\) be a maximum number of stars in \(P\) containing a vertex. The star valency of \(G\) is the minimum of \(M(P)\) taken over all star decompositions of \(G.\) In the paper, a polynomial time algorithm for determining the star valency of a graph is given.
0 references
star valency
0 references
polynomial algorithm
0 references
