Claw-free graphs---a survey

From MaRDI portal
Revision as of 14:27, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1356695

DOI10.1016/S0012-365X(96)00045-3zbMath0879.05043OpenAlexW2092366448WikidataQ55952667 ScholiaQ55952667MaRDI QIDQ1356695

Evelyne Flandrin, Zdeněk Ryjáček, Ralph J. Faudree

Publication date: 13 July 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00045-3




Related Items (only showing first 100 items - show all)

Determining finite connected graphs along the quadratic embedding constants of pathsConjecture of TxGraffiti: Independence, domination, and matchingsDegree sums of adjacent vertices for traceability of claw-free graphsResults on the small quasi-kernel conjectureLinear‐time algorithms for eliminating claws in graphsLine graphs with a Cohen-Macaulay or Gorenstein clique complexRadius, leaf number, connected domination number and minimum degree\(K_{1, 2}\)-isolation number of claw-free cubic graphsFinding and counting small induced subgraphs efficientlySemitotal domination in claw-free cubic graphsSpanning paths and cycles in triangle-free graphsHamiltonian cycles and 2-dominating induced cycles in claw-free graphsIntersection graphs of non-crossing pathsUnnamed ItemThe cycle spectrum of claw-free Hamiltonian graphsWhen Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear TimeUnnamed ItemDistinguished Minimal Topological LassosDisjunctive total domination in graphsBounds on the leaf number in graphs of girth 4 or 5Hamiltonian line graphs with local degree conditionsOn the performance guarantee of first fit for sum coloringFinding and counting small induced subgraphs efficientlyPadmakar-Ivan Index of Some Types of Perfect GraphsOn cycle-nice claw-free graphsMock threshold graphsSharp upper bounds on the minimum number of components of 2-factors in claw-free graphsOn Hamiltonicity of regular graphs with bounded second neighborhoodsCompressed cliques graphs, clique coverings and positive zero forcing\(D_ \lambda\)-cycles in \(\lambda\)-claw-free graphsHamiltonian cycles in linear-convex supergrid graphsUnnamed ItemMore aspects of arbitrarily partitionable graphsMinimum degree conditions for the Hamiltonicity of 3-connected claw-free graphsColoring graph classes with no induced fork via perfect divisibilityEliminating graphs by means of parallel knock-out schemesCharacterizations and algorithmic applications of chordal graph embeddingsSome local-global phenomena in locally finite graphsClaw-free strictly Deza graphsDegree and neighborhood conditions for Hamiltonicity of claw-free graphsPolynomially determining spanning connectivity of locally connected line graphsVertex disjoint copies of \(K_{1 , 4}\) in claw-free graphsThe maximum independent union of cliques problem: complexity and exact approachesOn weights of induced paths and cycles in claw-free andK1,r-free graphsGeneralizations of Dirac's theorem in Hamiltonian graph theory -- a surveyA note on anti-coordination and social interactionsSemipaired domination in claw-free cubic graphsUnnamed ItemClique coverings and claw-free graphsForbidden induced subgraphs for star-free graphsExact algorithms for finding longest cycles in claw-free graphsThe \(k\)-in-a-path problem for claw-free graphsClawfreeness of the powers of a graphSeveral improved asymptotic normality criteria and their applications to graph polynomialsImproving upper bounds for the distinguishing indexOn Hamiltonicity of \{claw, net\}-free graphsSufficient Conditions for a Connected Graph to Have a Hamiltonian PathOn local and global independence numbers of a graphWeights of induced subgraphs in \(K_{1,r}\)-free graphsDisjoint cliques in claw-free graphsHamiltonian properties of locally connected graphs with bounded vertex degreeLocating-total domination in claw-free cubic graphsCycle traversability for claw-free graphs and polyhedral mapsDominating set is fixed parameter tractable in claw-free graphsOn \(s\)-Hamiltonicity of net-free line graphsA characterization of claw-free \(b\)-perfect graphsHow many conjectures can you stand? A surveyTotal domination in claw-free graphs with minimum degree 2Maximally edge-connected and vertex-connected graphs and digraphs: A surveyBounds on total domination in claw-free cubic graphsPositive Zero Forcing and Edge Clique CoveringsParameterized complexity of induced graph matching on claw-free graphsA proof of a conjecture on diameter 2-critical graphs whose complements are claw-freeSpanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphsProgress on the Murty-Simon conjecture on diameter-2 critical graphs: a surveyInduced cycles in graphsDomination When the Stars Are OutFree fermions behind the disguiseMutual exclusion scheduling with interval graphs or related classes. IIPerfect matchings and \(K_{1,p}\)-restricted graphsForbidden subgraphs that imply 2-factorsTotal forcing and zero forcing in claw-free cubic graphsForbidden pairs with a common graph generating almost the same setsPath factors and parallel knock-out schemes of almost claw-free graphsClosure concept for 2-factors in claw-free graphsCuts leaving components of given minimum orderOn a conjecture on total domination in claw-free cubic graphsComputing Sharp 2-Factors in Claw-Free GraphsCollapsible biclaw-free graphsPath extendability of claw-free graphsUpper paired-domination in claw-free graphsComputing sharp 2-factors in claw-free graphsA clique-covering sufficient condition for hamiltonicity of graphsPartitioning the vertices of a cubic graph into two total dominating sets2-connected Hamiltonian claw-free graphs involving degree sum of adjacent verticesDeficiency and forbidden subgraphs of connected, locally-connected graphsTotal coloring conjecture for certain classes of graphsHamiltonian properties of triangular grid graphs2-factors with bounded number of components in claw-free graphsHamiltonicity in Partly claw-free graphs




Cites Work




This page was built for publication: Claw-free graphs---a survey