Acyclic Colourings of Planar Graphs With Large Girth

Journal of the London Mathematical Society - United Kingdom
doi 10.1112/s0024610799007942
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Wiley

Related search

Infinite Highly Connected Planar Graphs of Large Girth

Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg
Mathematics
2006English

Choosability of the Square of Planar Subcubic Graphs With Large Girth

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

NSD Total Choosability of Planar Graphs With Girth at Least Four

2016English

List Edge Chromatic Number of Graphs With Large Girth

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1992English

Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ Is Large

SIAM Journal on Discrete Mathematics
Mathematics
2019English

Topological Minors in Graphs of Large Girth

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2002English

Derived Colourings of Graphs

English

Colourings in Bipartite Graphs

International Journal of Computer Applications
2011English

Graphs With Bounded Tree-Width and Large Odd-Girth Are Almost Bipartite

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy