scientific article; zbMATH DE number 4047751
From MaRDI portal
Publication:3784093
Recommendations
Cited in
(30)- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- On simultaneous edge-face colorings of plane graphs
- Simultaneous coloring of edges and faces of plane graphs
- Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
- Simultaneously colouring the edges and faces of plane graphs
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
- On the colorings of outerplanar graphs
- \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle
- Simultaneous embedding of colored graphs
- All subgraphs of a wheel are 5-coupled-choosable
- Plane graphs with \(\Delta = 7\) are entirely 10-colorable
- Refined weight of edges in normal plane maps
- Plane graphs with maximum degree 9 are entirely 11-choosable
- Facial list colourings of plane graphs
- The entire choosability of plane graphs
- Weight of edges in normal plane maps
- Total coloring of planar graphs without chordal 7-cycles
- On the Number of Synchronizing Colorings of Digraphs
- Edge-face coloring of plane graphs with maximum degree nine
- scientific article; zbMATH DE number 4212106 (Why is no real title available?)
- Describing (d-2)-stars at d-vertices, d 5, in normal plane maps
- scientific article; zbMATH DE number 1205984 (Why is no real title available?)
- scientific article; zbMATH DE number 1934402 (Why is no real title available?)
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
- Simultaneous coloring of vertices and incidences of outerplanar graphs
- Simultaneous coloring of vertices and incidences of hypercubes
- Description of edges incident to 3-faces in 3-polytopes without adjacent 3-faces
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- Weight of 3-paths in sparse plane graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3784093)
