Pages that link to "Item:Q1378290"
From MaRDI portal
The following pages link to Total colourings of planar graphs with large girth (Q1378290):
Displaying 37 items.
- Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
- Hamiltonicity and generalised total colourings of planar graphs (Q274671) (← links)
- Total colorings of planar graphs with small maximum degree (Q360968) (← links)
- \(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438) (← links)
- \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (Q407567) (← links)
- On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
- Total colorings of planar graphs without intersecting 5-cycles (Q444447) (← links)
- \(L(2,1)\)-labelings of subdivisions of graphs (Q472974) (← links)
- Total coloring of planar graphs without 6-cycles (Q617651) (← links)
- Total coloring of embedded graphs of maximum degree at least ten (Q625795) (← links)
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles (Q641163) (← links)
- Fractional total colourings of graphs of high girth (Q651031) (← links)
- On \((p,1)\)-total labelling of 1-planar graphs (Q651281) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- Total colorings of planar graphs without small cycles (Q937252) (← links)
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable (Q967320) (← links)
- A strict strong coloring of trees (Q989572) (← links)
- Total and fractional total colourings of circulant graphs (Q998370) (← links)
- Total colorings of planar graphs without adjacent triangles (Q998509) (← links)
- Total colorings of planar graphs with maximum degree at least 8 (Q1043002) (← links)
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles (Q1043815) (← links)
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- Density of 5/2-critical graphs (Q1705839) (← links)
- \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle (Q1944131) (← links)
- The game coloring number of planar graphs with a given girth (Q2017053) (← links)
- Total coloring of recursive maximal planar graphs (Q2078611) (← links)
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree (Q2370454) (← links)
- \(L(2, 1)\)-labelings of the edge-path-replacement of a graph (Q2392735) (← links)
- \( L ( p , q )\)-labelings of subdivisions of graphs (Q2659077) (← links)
- The total chromatic number of some bipartite graphs (Q3439400) (← links)
- Some totally 4-choosable multigraphs (Q3504798) (← links)
- Girth and fractional chromatic number of planar graphs (Q3651181) (← links)
- On the total coloring of planar graphs. (Q3798676) (← links)
- Fractional DP-chromatic number of planar graphs of large girth (Q5063294) (← links)
- On the double total dominator chromatic number of graphs (Q5101880) (← links)
- (Q5708598) (← links)
