On Bounding the Difference of the Maximum Degree and the Clique Number

Graphs and Combinatorics - Japan
doi 10.1007/s00373-014-1468-3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Bounding the Maximum Likelihood Degree

Mathematical Research Letters
Mathematics
2015English

The Independence Number in Graphs of Maximum Degree Three

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2008English

Bounding the Piercing Number

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1995English

The Maximum Clique and the Signless Laplacian Eigenvalues

Czechoslovak Mathematical Journal
Mathematics
2008English

On the Clique Number of the Generating Graph of a Finite Group

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
2009English

A Complete Resolution of the Keller Maximum Clique Problem

2011English

MSClique: Multiple Structure Discovery Through the Maximum Weighted Clique Problem

PLoS ONE
Multidisciplinary
2016English

Bounding the Maximum Size of a Minimal Definitive Set of Quartets

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2012English

PUSH: A Generalized Operator for the Maximum Vertex Weight Clique Problem

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy