The structure of claw-free graphs

No abstract is available for this paper.

• Publication year

  2005

• Venue

  BCC

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1017/CBO9780511734885.008
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs

  2005cited by this paper
• On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs

  2004cited by this paper
• Strongly regular graphs

  2003cited by this paper
• Clique family inequalities for the stable set polytope of quasi-line graphs

  2003cited by this paper
• Strongly regular graphs

  2003cited by this paper
• A Description of Claw-Free Perfect Graphs

  1999cited by this paper
• The Rank Facets of the Stable Set Polytope for Claw-Free Graphs

  1997cited by this paper
• On stable set polyhedra for K1, 3-free graphs

  1981cited by this paper
• On maximal independent sets of vertices in claw-free graphs

  1980cited by this paper
• Paths, Trees, and Flowers

  1965cited by this paper
• in Claw-Free Graphs

  year unknowncited by this paper

• Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument

  2025cites this paper
• The structure of $\Delta(1, 2, 2)$-free tournaments

  2025cites this paper
• When MIS and Maximal Matching are Easy in the Congested Clique

  2025cites this paper
• On the independent set polynomial of graphs and claw-free graphs

  2025cites this paper
• Zero‐free regions for the independence polynomial on restricted graph classes

  2025cites this paper
• Vu's conjecture holds for claw-free graphs

  2025cites this paper
• Non-conflicting no-where zero $Z_2\times Z_2$ flows in cubic graphs

  2024cites this paper
• On the Additivity of Optimal Rates for Independent Zero-Error Source and Channel Problems

  2024cites this paper
• Counting induced subgraphs with the Kromatic symmetric function

  2024cites this paper
• Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs

  2024cites this paper
• Improved Approximation Algorithms for Index Coding

  2024influential citation
• A multiscale method for data collected from network edges via the line graph

  2024cites this paper
• Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius

  2023cites this paper
• Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs

  2023influential citation
• Coloring of Some Crown-Free Graphs

  2023cites this paper
• Optimal chromatic bound for ( P 2 + P 3 , P 2 + P 3 ¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$ )‐free graphs

  2023cites this paper
• Approximating Fair Division on D-Claw-Free Graphs

  2023cites this paper
• Age of Information Minimizing Dynamic User Pairing in Downlink NOMA Systems

  2023cites this paper
• Cutting a tree with subgraph complementation is hard, except for some small trees

  2022cites this paper
• Edge Contraction and Forbidden Induced Graphs

  2022cites this paper
• Counting Kernels in Directed Graphs with Arbitrary Orientations

  2022cites this paper
• Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás’ Path Argument

  2022cites this paper
• Finding Matching Cuts in H-Free Graphs

  2022cites this paper
• Homogeneous sets in graphs and a chromatic multisymmetric function

  2022cites this paper
• Results on the Small Quasi-Kernel Conjecture

  2022cites this paper
• Application of Tikhonov Regularization in Generalized Inverse of Adjacency Matrix of Undirected Graph

  2022cites this paper
• Edge Contraction and Line Graphs

  2022cites this paper
• Optimal chromatic bound for ($P_2+P_3$, $\bar{P_2+ P_3}$)-free graphs

  2022cites this paper
• The e-positivity of two classes of cycle-chord graphs

  2022cites this paper
• Recent Progress on Graphs with Fixed Smallest Adjacency Eigenvalue: A Survey

  2021cites this paper
• On Gorenstein graphs

  2021cites this paper
• Edge clique covers in graphs with independence number two

  2021cites this paper
• Edge Clique Covers in Graphs with Independence Number Two: a Special Case

  2021cites this paper
• Polynomial χ-binding functions for t-broom-free graphs

  2021cites this paper
• Partitioning H-Free Graphs of Bounded Diameter

  2021cites this paper
• Graphs hard-to-process for greedy algorithm MIN

  2021cites this paper
• Two cycle-chord graphs are $e$-positive

  2021cites this paper
• Graph-Theoretical Dynamic User Pairing for Downlink NOMA Systems

  2021cites this paper
• Connected $k$-partition of $k$-connected graphs and $c$-claw-free graphs

  2021cites this paper
• A Novel Method for Scheduling of Wireless Ad Hoc Networks in Polynomial Time

  2021cites this paper
• Square-Free Graphs with no Induced Fork

  2021cites this paper
• A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence

  2020cites this paper
• Edge decomposition of connected claw-free cubic graphs

  2020cites this paper
• Computing and Combinatorics: 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings

  2020cites this paper
• Separation routine and extended formulations for the stable set problem in claw-free graphs

  2020cites this paper
• Linear-time Algorithms for Eliminating Claws in Graphs

  2020cites this paper
• Cycle Traversability for Claw-Free Graphs and Polyhedral Maps

  2020cites this paper
• The uniqueness of covers for widely generalized line graphs

  2020cites this paper
• Free Fermions Behind the Disguise

  2020cites this paper
• Total coloring of the prismatic graphs

  2020cites this paper
• Recent progress on graphs with fixed smallest eigenvalue.

  2020cites this paper
• T he A lgorithmics C olumn by

  2020cites this paper
• Minimum weighted clique cover on claw‐free perfect graphs

  2020cites this paper
• On some graph classes related to perfect graphs: A survey

  2020cites this paper
• Clique‐width: Harnessing the power of atoms

  2020cites this paper
• An O(n2logn)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {O}}(n^2 \log {n})$$\end{document} algorithm for

  2020cites this paper
• Graphs without five-vertex path and four-vertex cycle

  2019cites this paper
• Groups with star free commuting graphs

  2019cites this paper
• When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time

  2019cites this paper
• Some Observations on the Smallest Adjacency Eigenvalue of a Graph

  2019cites this paper
• Normal 6-edge-colorings of some bridgeless cubic graphs

  2019cites this paper
• About Some Hereditary Classes of Graphs : Algorithms - Structure - Coloration

  2019influential citation
• Hadwiger Numbers and Gallai-Ramsey Numbers of Special Graphs

  2019cites this paper
• Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs

  2019cites this paper
• Fundamentals of Index Coding

  2018cites this paper
• The structure of claw-free binary matroids

  2018cites this paper
• Contracting to a Longest Path in H-Free Graphs

  2018cites this paper
• Cycle Traversability for Claw-Free Graphs and Polyhedral Maps

  2018cites this paper
• P12-colorings of cubic graphs

  2018cites this paper
• Disconnected Cuts in Claw-free Graphs

  2018cites this paper
• A Gramian Description of the Degree 4 Generalized Elliptope

  2018cites this paper
• Forbidden subgraphs for $k$ vertex-disjoint stars

  2018cites this paper
• S12 and P12-colorings of cubic graphs

  2018cites this paper
• On dominating set polyhedra of circular interval graphs

  2017cites this paper
• A note on 2-bisections of claw-free cubic graphs

  2017cites this paper
• Cycle decompositions and t-perfect graphs

  2017influential citation
• One-Three Join: A Graph Operation and Its Consequences

  2017cites this paper
• Distance-regular graphs without 4-claws

  2017cites this paper
• Scheduling wireless ad hoc networks in polynomial time using claw-free conflict graphs

  2017cites this paper
• Capturing Polynomial Time and Logarithmic Space using Modular Decompositions and Limited Recursion

  2017cites this paper
• Nearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time

  2017cites this paper
• The (theta, wheel)-free graphs Part II: Structure theorem

  2017cites this paper
• An O(mlogn)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{O}(m\log n)$$\end{document} algorithm for the weig

  2016cites this paper
• Local Clique Covering of Claw‐Free Graphs

  2016cites this paper
• Colouring Squares of Claw-free Graphs

  2016cites this paper
• A Generalization of Join and an Algorithmic Recognition Problem

  2016cites this paper
• The stable set polytope of icosahedral graphs

  2016cites this paper
• Lovász-Schrijver PSD-Operator on Claw-Free Graphs

  2016influential citation
• Squared Chromatic Number Without Claws or Large Cliques

  2016cites this paper
• Structural sparseness and complex networks

  2016cites this paper
• Spanning Halin Subgraphs Involving Forbidden Subgraphs

  2016cites this paper
• Approximate capacity of index coding for some classes of graphs

  2016cites this paper
• Squared chromatic and stability numbers without claws or large cliques

  2016cites this paper
• On Sylvester Colorings of Cubic Graphs

  2015cites this paper
• $t$-perfection in $P_5$-free graphs

  2015cites this paper
• Graph centers, hypergraph degree sequences, and induced-saturation

  2015cites this paper
• Graphs with Induced-Saturation Number Zero

  2015cites this paper
• On graphs that do not contain a theta nor a wheel Part I: two subclasses

  2015cites this paper
• On some applications of the selective graph coloring problem

  2015cites this paper
• List-Coloring Claw-Free Graphs with Δ-1 Colors

  2015influential citation