A Sufficient Condition for Planar Graphs With Maximum Degree 6 to Be Totally 8-Colorable

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2017.01.036
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

A Sufficient Condition for Planar Graphs of Maximum Degree 6 to Be Totally 7-Colorable

Discrete Dynamics in Nature and Society
ModelingSimulation
2020English

Necessary and Sufficient Condition for a Surface to Be a Sphere

Open Journal of Mathematical Analysis
2018English

Smaller Planar Triangle-Free Graphs That Are Not 3-List-Colorable

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2005English

A Sufficient Condition for the Second Derived Factor Group to Be Finite

Proceedings of the Edinburgh Mathematical Society
Mathematics
1987English

Computing Square Roots of Graphs With Low Maximum Degree

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

A Note on Uniquely H-Colorable Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2007English

Maximum Vertex and Face Degree of Oblique Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

The Degree/Diameter Problem in Maximal Planar Bipartite Graphs

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy