The Independence Number in Graphs of Maximum Degree Three

Discrete Mathematics - Netherlands
doi 10.1016/j.disc.2007.10.029
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Degree-Associated Reconstruction Number of Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2010English

Maximum Vertex and Face Degree of Oblique Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

On the Number of Connected Sets in Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Acyclic Vertex Coloring of Graphs of Maximum Degree 5

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2011English

Computing Square Roots of Graphs With Low Maximum Degree

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Optimal Pebbling Number of Graphs With Given Minimum Degree

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

The Number of Spanning Trees in Graphs With a Given Degree Sequence

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

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

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2014English

Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy