Some sufficient conditions for a planar graph of maximum degree six to be Class 1 (Q2497482): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2006.03.032
+Normal rank
@@ Property / OpenAlex ID @@
+W2030707025
@@ Property / OpenAlex ID: W2030707025 / rank @@
+Normal rank
@@ Property / cites work @@
+Some 4-valent, 3-connected, planar, almost pancyclic graphs
+Normal rank
@@ Property / cites work @@
+Planar graphs without cycles of specific lengths
@@ Property / cites work: Planar graphs without cycles of specific lengths / rank @@
+Normal rank
@@ Property / cites work @@
+Q3853641
@@ Property / cites work: Q3853641 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs of maximum degree seven are Class I
@@ Property / cites work: Planar graphs of maximum degree seven are Class I / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring edges of graphs embedded in a surface of characteristic zero.
+Normal rank
@@ Property / cites work @@
+Q5558480
@@ Property / cites work: Q5558480 / rank @@
+Normal rank
@@ Property / cites work @@
+Choosability and edge choosability of planar graphs without five cycles
+Normal rank
@@ Property / cites work @@
+Every planar graph with maximum degree 7 is of class 1
+Normal rank
@@ Property / cites work @@
+A note on graphs of class I
@@ Property / cites work: A note on graphs of class I / rank @@
+Normal rank