P4-equicoverable graphs which contain cycles with length at least 4 (Q5370827): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5480688 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: All \(P_{3}\)-equipackable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Randomly decomposable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A short update on equipackable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(P_{3}\)-equicoverable graphs-research on \(H\)-equicoverable graphs / rank | |||
Normal rank |
Latest revision as of 14:02, 14 July 2024
scientific article; zbMATH DE number 6794607
Language | Label | Description | Also known as |
---|---|---|---|
English | P4-equicoverable graphs which contain cycles with length at least 4 |
scientific article; zbMATH DE number 6794607 |
Statements
P4-equicoverable graphs which contain cycles with length at least 4 (English)
0 references
20 October 2017
0 references
cycle
0 references
covering
0 references
equicoverable graph
0 references