Removable edges and chords of longest cycles in 3-connected graphs (Q2014727): Difference between revisions

@@ Property / cites work @@
+Every longest circuit of a 3‐connected,<i>K</i><sub>3,3</sub>‐minor free graph has a chord
+Normal rank
@@ Property / cites work @@
+Q4871748
@@ Property / cites work: Q4871748 / rank @@
+Normal rank
@@ Property / cites work @@
+Chords of longest cycles in cubic graphs
@@ Property / cites work: Chords of longest cycles in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Removable edges in 3-connected graphs
@@ Property / cites work: Removable edges in 3-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Chords of longest circuits in locally planar graphs
+Normal rank
@@ Property / cites work @@
+Chords of longest circuits in 3-connected graphs
@@ Property / cites work: Chords of longest circuits in 3-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Chords of longest circuits of graphs embedded in torus and Klein bottle
+Normal rank
@@ Property / cites work @@
+The number of removable edges in 3-connected graphs
+Normal rank
@@ Property / cites work @@
+Longest cycles and their chords
@@ Property / cites work: Longest cycles and their chords / rank @@
+Normal rank