Coloring 3-power of 3-subdivision of subcubic graph
From MaRDI portal
Publication:4554572
DOI10.1142/S1793830918500416zbMATH Open1400.05091WikidataQ130103456 ScholiaQ130103456MaRDI QIDQ4554572FDOQ4554572
Authors: Fang Wang, Xiaoping Liu
Publication date: 14 November 2018
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Recommendations
Cites Work
- Acyclic colorings of planar graphs
- The total chromatic number of any multigraph with maximum degree five is at most seven
- A concise proof for total coloring subcubic graphs
- On the total coloring of certain graphs
- On the total coloring of generalized Petersen graphs
- On the total coloring of planar graphs.
- Title not available (Why is that?)
- On Total Chromatic Number of a Graph
- Total coloring of planar graphs of maximum degree eight
- Planar graphs of maximum degree seven are Class I
- On colorings of graph fractional powers
Cited In (8)
- Title not available (Why is that?)
- Simultaneous coloring of vertices and incidences of hypercubes
- A note on coloring of \(\frac{3}{3}\)-power of subquartic graphs
- Computational complexity aspects of super domination
- Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge
- On the chromatic number of powers of subdivisions of graphs
- Simultaneous coloring of vertices and incidences of outerplanar graphs
- On incidence coloring of graph fractional powers
This page was built for publication: Coloring 3-power of 3-subdivision of subcubic graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554572)