Choosability of the Square of Planar Subcubic Graphs With Large Girth

Discrete Mathematics - Netherlands
doi 10.1016/j.disc.2007.12.100
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

NSD Total Choosability of Planar Graphs With Girth at Least Four

2016English

Acyclic Colourings of Planar Graphs With Large Girth

Journal of the London Mathematical Society
Mathematics
1999English

Infinite Highly Connected Planar Graphs of Large Girth

Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg
Mathematics
2006English

Induced Matchings in Subcubic Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Planar Lombardi Drawings for Subcubic Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

List Edge Chromatic Number of Graphs With Large Girth

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1992English

Topological Minors in Graphs of Large Girth

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

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

SIAM Journal on Discrete Mathematics
Mathematics
2008English

Interval Incidence Coloring of Subcubic Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy