Algorithmic Aspects of Acyclic Edge Colorings

Algorithmica - United States
doi 10.1007/s00453-001-0093-8
Full Text
Abstract

Available in full text

Date
Authors

Unknown

Publisher

Springer Science and Business Media LLC

Related search

Strong Edge Colorings of Uniform Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2004English

M_{2}-Edge Colorings of Dense Graphs

Opuscula Mathematica
Mathematics
2016English

Algorithmic Aspects of Tree Amalgamation

Journal of Algorithms
2000English

Algorithmic Aspects of Bandwidth Trading

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Directed Acyclic Graphs With Edge-Specific Bounds

Biometrika
StatisticsProbabilityUncertaintyApplied MathematicsBiological SciencesAgriculturalMathematics
2011English

Algorithmic Aspects of Partial List Colourings

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2000English

Algorithmic Aspects of Proportional Symbol Maps

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Algorithmic Aspects of Heterogeneous Biological Networks Comparison

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

The Lower Bounds of the Interval Edge-Colorings of Infinite Bicyclic Graphs

Advances in Applied Mathematics
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy