Upper Bounds to the Clique Width of Graphs

Discrete Applied Mathematics - Netherlands
doi 10.1016/s0166-218x(99)00184-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Infinitely Many Minimal Classes of Graphs of Unbounded Clique-Width

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width

SIAM Journal on Computing
MathematicsComputer Science
2014English

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Collective Tree Spanners in Graphs With Bounded Genus, Chordality, Tree-Width, or Clique-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Upper Bounds for 4-Rainbow Index of Graphs

DEStech Transactions on Engineering and Technology Research
2018English

Sharp Upper Bounds for the Laplacian Spectral Radius of Graphs

Mathematical Problems in Engineering
MathematicsEngineering
2013English

Approximating Rank-Width and Clique-Width Quickly

ACM Transactions on Algorithms
Mathematics
2008English

From Tree-Decompositions to Clique-Width Terms

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

On Clique Convergent Graphs

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1995English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy