Disjoint chorded cycles in graphs (Q998485): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.10.040 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2001686801 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On independent cycles and edges in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4842721 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the maximal number of independent circuits in a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3826605 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4276003 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5342985 / rank | |||
Normal rank |
Revision as of 01:08, 29 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Disjoint chorded cycles in graphs |
scientific article |
Statements
Disjoint chorded cycles in graphs (English)
0 references
28 January 2009
0 references
cycles
0 references
cycles with chords
0 references