A 3-color theorem on plane graphs without 5-circuits (Q2644333): Difference between revisions

@@ Property / author @@
-Bao-Gang Xu
@@ Property / author: Bao-Gang Xu / rank @@
-Normal rank
@@ Property / author @@
+Bao-Gang Xu
@@ Property / author: Bao-Gang Xu / rank @@
+Normal rank
@@ 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.1007/s10114-005-0851-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2106859304
@@ Property / OpenAlex ID: W2106859304 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139765
@@ Property / cites work: Q3139765 / rank @@
+Normal rank
@@ Property / cites work @@
+Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
+Normal rank
@@ Property / cites work @@
+Q4000782
@@ Property / cites work: Q4000782 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the three color problem
@@ Property / cites work: A note on the three color problem / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs without cycles of length from 4 to 7 are 3-colorable
+Normal rank
@@ Property / cites work @@
+On 3-colorable plane graphs without 5- and 7-cycles
+Normal rank
@@ Property / cites work @@
+A sufficient condition for planar graphs to be 3-colorable
+Normal rank
@@ Property / cites work @@
+On 3-colorings of plane graphs
@@ Property / cites work: On 3-colorings of plane graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2644333