Graphs in which every <i>c</i> edges that form a tree are chords of a common cycle (Q5012358): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Graph Classes: A Survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A generalization of a theorem of Dirac / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3025206 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5477380 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pairs of edges as chords and as cut-edges / rank | |||
Normal rank |
Latest revision as of 12:16, 26 July 2024
scientific article; zbMATH DE number 7389390
Language | Label | Description | Also known as |
---|---|---|---|
English | Graphs in which every <i>c</i> edges that form a tree are chords of a common cycle |
scientific article; zbMATH DE number 7389390 |
Statements
Graphs in which every <i>c</i> edges that form a tree are chords of a common cycle (English)
0 references
1 September 2021
0 references
chord
0 references
cycle
0 references
connectivity
0 references