Defect-d matchings in graphs with cyclomatic numbers 0,1 and 2 (Q1147718): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3258698 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3941433 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An introduction to matching polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On defect-d matchings in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The parity of the number of 1-factors of a graph / rank | |||
Normal rank | |||
Latest revision as of 10:06, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Defect-d matchings in graphs with cyclomatic numbers 0,1 and 2 |
scientific article |
Statements
Defect-d matchings in graphs with cyclomatic numbers 0,1 and 2 (English)
0 references
1981
0 references
recurrence relation
0 references
matching polynomials
0 references
chains
0 references
circuits
0 references
basic graphs with cyclomatic number 2
0 references
defect-d matchings
0 references
