Every Planar Graph Without Cycles of Lengths 4 to 12 Is Acyclically 3-Choosable

Information Processing Letters - Netherlands
doi 10.1016/j.ipl.2009.08.004
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Every 5-Connected Planar Triangulation Is 4-Ordered Hamiltonian

Journal of Algebra Combinatorics Discrete Structures and Applications
CombinatoricsDiscrete MathematicsNumber TheoryAlgebra
2015English

On the Number of Paths of Lengths 3 and 4 in a Graph

International Journal of Applied Mathematical Research
2014English

Solvable Probabilistic Model for Cycles in Planar Graph

Interdisciplinary Information Sciences
2009English

Every 3-Connected, Locally Connected, Claw-Free Graph Is Hamilton-Connected

Journal of Graph Theory
GeometryTopology
1996English

Every Monotone Graph Property Is Testable

2005English

Every 8-Traceable Oriented Graph Is Traceable

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2017English

Every Graph Is an Integral Distance Graph in the Plane

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
1997English

The Dimension of the Planar Brownian Frontier Is 4/3

Mathematical Research Letters
Mathematics
2001English

The Number of Cycles in Random Permutations Without Long Cycles Is Asymptotically Gaussian

Alea
StatisticsProbability
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy