Apply Partition Tree to Compute Canonical Labelings of Graphs

International Journal of Grid and Distributed Computing - Australia
doi 10.14257/ijgdc.2016.9.5.21
Full Text
Abstract

Available in full text

Date
Authors
Publisher

NADIA

Related search

Simply Sequentially Additive Labelings of 2-Regular Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2010English

Distance Constrained Labelings of Planar Graphs With No Short Cycles

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

Subsets of Configurations and Canonical Partition Functions

Physical Review D
2013English

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

SIAM Journal on Discrete Mathematics
Mathematics
2005English

On the Partition Dimension of Disconnected Graphs

Journal of Mathematical and Fundamental Sciences
Planetary SciencesGeneticsAstronomyMolecular BiologyBiochemistryMultidisciplinaryBiological SciencesMathematicsEarthMedicineAgriculturalChemistryPhysics
2017English

A Canonical Partition of the Periodic Orbits of Chaotic Maps

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1985English

The Complexity of the List Partition Problem for Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2008English

Gipsy Moth Tree-Banding Material : How to Make, Use, and Apply It /

1920English

Tree Decompositions and Social Graphs

Internet Mathematics
Computational MathematicsApplied MathematicsSimulationModeling
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy