Nonplanar graphs and well-covered cycles (Q809092): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / cites work | |||
Property / cites work: On the cycle space of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The cycle space of an embedded graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Embeddings of graphs with no short noncontractible cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4273853 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127629415 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(90)90024-c / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1978883959 / rank | |||
Normal rank |
Latest revision as of 11:05, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nonplanar graphs and well-covered cycles |
scientific article |
Statements
Nonplanar graphs and well-covered cycles (English)
0 references
1990
0 references
If G is planar then the collection \({\mathcal C}\) of face boundaries of a planar embedding satisfy the following properties: (i) each edge of G is in exactly two members of \({\mathcal C}\); and (ii) for each spanning tree T of G, at least two members of \({\mathcal C}\) have all but one edge in T. Rosenfeld conjectured in 1988 that a 2-connected graph with a set of cycles \({\mathcal C}\) satisfying (i) and (ii) is planar. This note furnishes a counterexample to Rosenfeld's conjecture, which is isomorphic to the line graph of the Petersen graph. That it satisfies (ii) is easily shown by looking at its geometric dual.
0 references
planar graph
0 references
covering cycles
0 references