Total Coloring of Dumbbell Maximal Planar Graphs
The Total Coloring Conjecture (TCC) states that every simple graph <i>G</i> is totally <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>(</mo><mo>Δ</mo><mo>+<...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-03-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/6/912 |