Strong chromatic index of planar graphs with large girth (Q472129): Difference between revisions

@@ Property / author @@
-Mickaël Montassier
@@ Property / author: Mickaël Montassier / rank @@
-Normal rank
@@ Property / author @@
-Andre Raspaud
@@ Property / author: Andre Raspaud / rank @@
-Normal rank
@@ Property / author @@
+Mickaël Montassier
@@ Property / author: Mickaël Montassier / rank @@
+Normal rank
@@ Property / author @@
+Andre Raspaud
@@ Property / author: Andre Raspaud / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C15
@@ Property / Mathematics Subject Classification ID: 05C15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C10
@@ Property / Mathematics Subject Classification ID: 05C10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C12
@@ Property / Mathematics Subject Classification ID: 05C12 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C07
@@ Property / Mathematics Subject Classification ID: 05C07 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 05C35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6370475
@@ Property / zbMATH DE Number: 6370475 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+planar graphs
@@ Property / zbMATH Keywords: planar graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+edge coloring
@@ Property / zbMATH Keywords: edge coloring / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+-distance-coloring
@@ Property / zbMATH Keywords: 2-distance-coloring / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+strong edge coloring
@@ Property / zbMATH Keywords: strong edge coloring / 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.7151/dmgt.1763
@@ Property / full work available at URL: https://doi.org/10.7151/dmgt.1763 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2018699805
@@ Property / OpenAlex ID: W2018699805 / rank @@
+Normal rank
@@ Property / cites work @@
+The strong chromatic index of a cubic graph is at most 10
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+Q3936766
@@ Property / cites work: Q3936766 / rank @@
+Normal rank
@@ Property / cites work @@
+Precise upper bound for the strong edge chromatic number of sparse planar graphs
+Normal rank
@@ Property / cites work @@
+Strong edge-coloring of graphs with maximum degree 4 using 22 colors
+Normal rank
@@ Property / cites work @@
+Problems and results in combinatorial analysis and graph theory
+Normal rank
@@ Property / cites work @@
+Q5752590
@@ Property / cites work: Q5752590 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3320410
@@ Property / cites work: Q3320410 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3216671
@@ Property / cites work: Q3216671 / rank @@
+Normal rank
@@ Property / cites work @@
+Strong edge-colouring and induced matchings
@@ Property / cites work: Strong edge-colouring and induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings in cubic graphs
@@ Property / cites work: Induced matchings in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The strong chromatic index ofC4-free graphs
@@ Property / cites work: The strong chromatic index ofC4-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A bound on the strong chromatic index of a graph
@@ Property / cites work: A bound on the strong chromatic index of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Colorings and girth of oriented planar graphs
@@ Property / cites work: Colorings and girth of oriented planar graphs / 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
@@ links / mardi / name / links / mardi / name @@
+Publication:472129