Amanote Research

Amanote Research

    RegisterSign In

Distance Constrained Labelings of Planar Graphs With No Short Cycles

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2008.08.013
Full Text
Open PDF
Abstract

Available in full text

Categories
CombinatoricsApplied MathematicsDiscrete Mathematics
Date

June 1, 2009

Authors
Zdeněk DvořákDaniel Král’Pavel NejedlýRiste Škrekovski
Publisher

Elsevier BV


Related search

Projective-Planar Graphs With No K 3, 4 -Minor. II

Journal of Graph Theory
GeometryTopology
2016English

A Problem on Edge-Magic Labelings of Cycles

Canadian Mathematical Bulletin
Mathematics
2014English

Simply Sequentially Additive Labelings of 2-Regular Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2010English

On the Structure of Graphs With Non-Surjective L(2,1)-Labelings

SIAM Journal on Discrete Mathematics
Mathematics
2005English

Apply Partition Tree to Compute Canonical Labelings of Graphs

International Journal of Grid and Distributed Computing
Computer Science
2016English

Planar and Non-Planar Graphs

International Journal of Modern Trends in Engineering & Research
2017English

Cycles in Graphs With Large Independence Ratio

Journal of Combinatorics
2011English

Acyclic Colourings of Planar Graphs With Large Girth

Journal of the London Mathematical Society
Mathematics
1999English

Intuitionistic Fuzzy Planar Graphs

Discrete Dynamics in Nature and Society
ModelingSimulation
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy