Covering graphs with matchings of fixed size (Q960925): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3424771 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On minimum sets of 1-factors covering a complete multipartite graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5604409 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Solution of a Timetabling Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5650698 / rank | |||
Normal rank |
Latest revision as of 14:47, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Covering graphs with matchings of fixed size |
scientific article |
Statements
Covering graphs with matchings of fixed size (English)
0 references
29 March 2010
0 references
excessive \([m]\)-factorization
0 references
excessive \([m]\)-index
0 references
\([m]\)-covering
0 references