NSD Total Choosability of Planar Graphs With Girth at Least Four

doi 10.2991/msota-16.2016.18
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Atlantis Press

Related search

Choosability of the Square of Planar Subcubic Graphs With Large Girth

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Planar Graphs of Odd-Girth at Least 9 Are Homomorphic to the Petersen Graph

SIAM Journal on Discrete Mathematics
Mathematics
2008English

Acyclic Colourings of Planar Graphs With Large Girth

Journal of the London Mathematical Society
Mathematics
1999English

Cubic Graphs With Total Domatic Number at Least Two

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Infinite Highly Connected Planar Graphs of Large Girth

Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg
Mathematics
2006English

Total Coloring of Claw-Free Planar Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

List Edge Chromatic Number of Graphs With Large Girth

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1992English

Spanning Trees With Leaf Distance at Least Four

Journal of Graph Theory
GeometryTopology
2007English

Graphs of Prescribed Girth and Bi-Degree

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy