Infinitely Many Minimal Classes of Graphs of Unbounded Clique-Width

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2017.02.012
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Upper Bounds to the Clique Width of Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2000English

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

Clique Graphs of Chordal and Path Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1994English

Approximating Rank-Width and Clique-Width Quickly

ACM Transactions on Algorithms
Mathematics
2008English

On Clique Convergent Graphs

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1995English

Clique Coloring of Binomial Random Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2018English

Maximal-Clique Partitions of Interval Graphs

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1988English

Direct Sums of Infinitely Many Kernels

Journal of the Australian Mathematical Society
Mathematics
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy