On graph proper total colorings with labelling-type restrictions
From MaRDI portal
Publication:6188237
Recommendations
Cites work
- 1-平面图的结构性质及其在无圈边染色上的应用
- A new upper bound on the acyclic chromatic indices of planar graphs
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
- Acyclic edge chromatic number of outerplanar graphs
- Circular vertex arboricity
- Edge Coloring of Triangle-Free 1-Planar Graphs
- Edge colorings of planar graphs with maximum degree five.
- Graph theory
- Linear coloring of graphs without 4-cycles and embeddable in a surface of nonnegative Euler characteristic
- Linear coloring of planar graphs without 4-cycles
- On the equitable total coloring of some join-graphs
- Some bounds on the neighbor-distinguishing index of graphs
- Some results on spanning trees
- The strong edge-coloring of Halin graphs with 4
- Total coloring of embedded graphs of maximum degree at least ten
- Total coloring of planar graphs with maximum degree 7
- Total coloring of planar graphs without 6-cycles
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
This page was built for publication: On graph proper total colorings with labelling-type restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6188237)
