Sharp Upper Bounds on the Minimum Number of Components of 2-Factors in Claw-Free Graphs

Graphs and Combinatorics - Japan
doi 10.1007/s00373-009-0855-7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Sharp Upper Bounds for the Laplacian Spectral Radius of Graphs

Mathematical Problems in Engineering
MathematicsEngineering
2013English

On the Characterization of Claw-Free Graphs With Given Total Restrained Domination Number

SpringerPlus
Multidisciplinary
2016English

Colouring Squares of Claw-Free Graphs

Canadian Journal of Mathematics
Mathematics
2019English

Claw-Free Circular-Perfect Graphs

Journal of Graph Theory
GeometryTopology
2010English

Total Coloring of Claw-Free Planar Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

Induced Disjoint Paths in Claw-Free Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2015English

Claw-Free Graphs. V. Global Structure

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2008English

Lower Bounds on the Number of Realizations of Rigid Graphs

Experimental Mathematics
Mathematics
2018English

New Bounds on the Grundy Number of Products of Graphs

Journal of Graph Theory
GeometryTopology
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy