Graph algorithms (graph-theoretic aspects) (05C85) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
Cites work
- scientific article; zbMATH DE number 4177109 (Why is no real title available?)
- scientific article; zbMATH DE number 4191710 (Why is no real title available?)
- scientific article; zbMATH DE number 3884202 (Why is no real title available?)
- scientific article; zbMATH DE number 3851153 (Why is no real title available?)
- scientific article; zbMATH DE number 4200251 (Why is no real title available?)
- scientific article; zbMATH DE number 4135992 (Why is no real title available?)
- scientific article; zbMATH DE number 4164900 (Why is no real title available?)
- scientific article; zbMATH DE number 3818558 (Why is no real title available?)
- scientific article; zbMATH DE number 3914371 (Why is no real title available?)
- scientific article; zbMATH DE number 3966120 (Why is no real title available?)
- scientific article; zbMATH DE number 3974990 (Why is no real title available?)
- scientific article; zbMATH DE number 4033781 (Why is no real title available?)
- scientific article; zbMATH DE number 4043880 (Why is no real title available?)
- scientific article; zbMATH DE number 4043881 (Why is no real title available?)
- scientific article; zbMATH DE number 4081604 (Why is no real title available?)
- scientific article; zbMATH DE number 4085681 (Why is no real title available?)
- scientific article; zbMATH DE number 4101231 (Why is no real title available?)
- scientific article; zbMATH DE number 4101248 (Why is no real title available?)
- scientific article; zbMATH DE number 4104996 (Why is no real title available?)
- scientific article; zbMATH DE number 3730183 (Why is no real title available?)
- scientific article; zbMATH DE number 3747156 (Why is no real title available?)
- scientific article; zbMATH DE number 3779369 (Why is no real title available?)
- scientific article; zbMATH DE number 15664 (Why is no real title available?)
- scientific article; zbMATH DE number 19208 (Why is no real title available?)
- scientific article; zbMATH DE number 33169 (Why is no real title available?)
- scientific article; zbMATH DE number 68918 (Why is no real title available?)
- scientific article; zbMATH DE number 97635 (Why is no real title available?)
- scientific article; zbMATH DE number 123835 (Why is no real title available?)
- scientific article; zbMATH DE number 147629 (Why is no real title available?)
- scientific article; zbMATH DE number 147638 (Why is no real title available?)
- scientific article; zbMATH DE number 147639 (Why is no real title available?)
- scientific article; zbMATH DE number 147641 (Why is no real title available?)
- scientific article; zbMATH DE number 147642 (Why is no real title available?)
- scientific article; zbMATH DE number 147654 (Why is no real title available?)
- scientific article; zbMATH DE number 3492724 (Why is no real title available?)
- scientific article; zbMATH DE number 3508534 (Why is no real title available?)
- scientific article; zbMATH DE number 637321 (Why is no real title available?)
- scientific article; zbMATH DE number 734468 (Why is no real title available?)
- scientific article; zbMATH DE number 5523 (Why is no real title available?)
- scientific article; zbMATH DE number 3445275 (Why is no real title available?)
- scientific article; zbMATH DE number 842880 (Why is no real title available?)
- scientific article; zbMATH DE number 863469 (Why is no real title available?)
- scientific article; zbMATH DE number 867709 (Why is no real title available?)
- scientific article; zbMATH DE number 883275 (Why is no real title available?)
- scientific article; zbMATH DE number 894709 (Why is no real title available?)
- scientific article; zbMATH DE number 913268 (Why is no real title available?)
- scientific article; zbMATH DE number 1409251 (Why is no real title available?)
- scientific article; zbMATH DE number 1424871 (Why is no real title available?)
- scientific article; zbMATH DE number 3893237 (Why is no real title available?)
- scientific article; zbMATH DE number 223376 (Why is no real title available?)
- scientific article; zbMATH DE number 270251 (Why is no real title available?)
- scientific article; zbMATH DE number 3286813 (Why is no real title available?)
- scientific article; zbMATH DE number 3412692 (Why is no real title available?)
- scientific article; zbMATH DE number 3192675 (Why is no real title available?)
- scientific article; zbMATH DE number 4183448 (Why is no real title available?)
- 1-Factors and Antifactor Sets
- 2‐neighborhoods and hamiltonian conditions
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- A Characterization of Comparability Graphs and of Interval Graphs
- A characterization of domination perfect graphs
- A generalization of Dirac's theorem for \(K(1,3)\)-free graphs
- A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
- A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian
- A new sufficient condition for hamiltonian graphs
- A note on Hamiltonian circuits
- A note on \(K_ 4\)-closures in hamiltonian graph theory
- A note on locally connected and Hamiltonian-connected graphs
- A note on the characterization of domination perfect graphs
- A note on the edge-reconstruction of \(K_{1,m}\)-free graphs
- A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs
- A strengthening of Ben Rebea's lemma
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
- Almost claw‐free graphs
- Applications of edge coloring of multigraphs to vertex coloring of graphs
- CHROMATIC BOUNDS FOR A CLASS OF GRAPHS
- Characterizations of derived graphs
- Claw‐free graphs are edge reconstructible
- Connected, locally 2-connected,K1,3-free graphs are panconnected
- Cycles of given length in some \(K_{1,3}\)-free graphs
- Cycles through particular subgraphs of claw‐free graphs
- Degree conditions and cycle extendability
- Disjoint cycles in star-free graphs
- Dominating cycles in bipartite biclaw-free graphs
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Existence of dominating cycles and paths
- Existence of Δλ-cycles and Δλ-paths
- Extending cycles in graphs
- Extending matchings in claw-free graphs
- Factors and factorizations of graphs—a survey
- Factors of claw-free graphs
- Forbidden induced subgraphs for line graphs
- Forbidden subgraphs and Hamiltonian properties and graphs
- Forbidden subgraphs and hamiitonian properties in the square of a connected graph
- Generalized degree conditions for graphs with bounded independence number
- Graph theory
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Graphs with 1-Factors
- Hamilton cycle and dominating cycle in \(k\)-connected claw-free graphs
- Hamilton cycles in claw-free graphs
- Hamilton cycles in regular 2-connected graphs
- Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
- Hamiltonian cycles in 2‐connected claw‐free‐graphs
- Hamiltonian cycles in 3‐connected claw‐free graphs
- Hamiltonian properties of graphs with large neighborhood unions
- Hamiltonian results inK1,3-free graphs
- Hamiltonicity for K1, r‐free graphs
- Hamiltonicity in 2-connected graphs with claws
- Hamiltonicity in \(2\)-connected claw-free graphs
- Hamiltonicity in claw-free graphs
- Hamiltonicity in claw-free graphs through induced bulls
- Hamiltonicity of bipartite biclaw-free graphs
- Hamiltonism, degree sum and neighborhood intersections
- How To Color Claw-Free Perfect Graphs
- Local properties of graphs
- Long paths and cycles in tough graphs
- Longest cycles in regular 2-connected claw-free graphs
- Longest paths and cycles in K1,3-free graphs
- Matching theory
- Mengerian properties, hamiltonicity, and claw‐free graphs
- Note on Choudum's “chromatic bounds for a class of graphs”
- On Hamiltonian claw-free graphs
- On claw-freeM-oriented critical kernel-imperfect digraphs
- On domination and independent domination numbers of a graph
- On graphs satisfying a local ore-type condition
- On graphs with equal domination and independent domination numbers
- On hamiltonian line graphs and connectivity
- On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
- On maximal independent sets of vertices in claw-free graphs
- On pancyclic claw-free graphs
- On partitioning the edges of graphs into connected subgraphs
- On stable set polyhedra for K//(1,3)free graphs
- On the Cube of a Graph
- On the chromatic index of multigraphs without large triangles
- On the chromatic number of a graph with two forbidden subgraphs
- On the existence of 1-factors in partial squares of graphs
- On the numbers of independent \(k\)-sets in a claw free graph
- On the stability number of AH‐free graphs
- Pancyclism in hamiltonian graphs
- Paths, Trees, and Flowers
- Paw-free graphs
- Quasi-claw-free graphs
- Recognizing claw-free perfect graphs
- Reflections on graph theory
- Regular factors in K1,3‐free graphs
- Regular factors in K1,n free graphs
- Some applications of Vizing's theorem to vertex colorings of graphs
- Some localization theorems on Hamiltonian circuits
- Some sufficient conditions for the existence of a 1-factor
- Stability in CAN-free graphs
- Stability number of bull- and chair-free graphs
- Stability, domination and irredundance in a graph
- Sufficient conditions for a graph to be Hamiltonian
- The NP-completeness column: an ongoing guide
- The binding number of a graph and its Anderson number
- The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\)
- The edge Hamiltonian path problem is NP-complete
- The monotone circuit complexity of Boolean functions
- The square of a connected S(K1,3)-free graph is vertex pancyclic
- The strong perfect graph conjecture for pan-free graphs
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- The struction of a graph: Application to CN-free graphs
- Tough graphs and Hamiltonian circuits.
- Toughness and hamiltonicity in almost claw-free graphs
- Trees with Hamiltonian square
- Updating the hamiltonian problem—A survey
- Which claw-free graphs are perfectly orderable?
Cited in
(only showing first 100 items - show all)- Computing sharp 2-factors in claw-free graphs
- How many conjectures can you stand? A survey
- Claw-free graphs. II: Non-orientable prismatic graphs
- Computing Sharp 2-Factors in Claw-Free Graphs
- Pancyclic type properties of claw-free \(P_6\)-free graphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Exact algorithms for finding longest cycles in claw-free graphs
- 2-factors with bounded number of components in claw-free graphs
- Several improved asymptotic normality criteria and their applications to graph polynomials
- On a conjecture on total domination in claw-free cubic graphs
- A characterization of claw-free \(b\)-perfect graphs
- Cycle traversability for claw-free graphs and polyhedral maps
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- Edge decomposition of connected claw-free cubic graphs
- Clawfreeness of the powers of a graph
- Claw-free graphs. I: Orientable prismatic graphs
- Spanning paths and cycles in triangle-free graphs
- Positive zero forcing and edge clique coverings
- A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
- Edge-distinguishing of star-free graphs
- Cuts leaving components of given minimum order
- Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures
- Weights of induced subgraphs in \(K_{1,r}\)-free graphs
- scientific article; zbMATH DE number 7274067 (Why is no real title available?)
- Forbidden subgraphs that imply 2-factors
- Total forcing and zero forcing in claw-free cubic graphs
- The \(k\)-in-a-path problem for claw-free graphs
- On weights of induced paths and cycles in claw-free and \(K_{1,r}\)-free graphs
- Forbidden induced subgraphs for star-free graphs
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Clique coverings and claw-free graphs
- The parameterized complexity of the induced matching problem
- Results on the small quasi-kernel conjecture
- Eliminating graphs by means of parallel knock-out schemes
- A note on anti-coordination and social interactions
- On the structure of graphs without claw, \(4K_1\) and co-R
- Characterizations and algorithmic applications of chordal graph embeddings
- Hamiltonian properties of triangular grid graphs
- Upper paired-domination in claw-free graphs
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- Total coloring conjecture for certain classes of graphs
- A clique-covering sufficient condition for hamiltonicity of graphs
- Claw-free graphs. IV: Decomposition theorem
- Hamiltonian properties of locally connected graphs with bounded vertex degree
- Induced cycles in graphs
- Some local-global phenomena in locally finite graphs
- Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs
- Bounds on total domination in claw-free cubic graphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- scientific article; zbMATH DE number 4135992 (Why is no real title available?)
- Total domination in claw-free graphs with minimum degree 2
- Hamiltonicity in Partly claw-free graphs
- Locating-total domination in claw-free cubic graphs
- Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs
- On the Erdős-Gyárfás conjecture in claw-free graphs
- Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs
- Semipaired domination in claw-free cubic graphs
- Forbidden pairs with a common graph generating almost the same sets
- Parameterized complexity of induced graph matching on claw-free graphs
- Hamiltonian cycles in linear-convex supergrid graphs
- Domination versus total domination in claw-free cubic graphs
- Disjunctive total domination in graphs
- Finding and counting small induced subgraphs efficiently
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- Semitotal domination in claw-free cubic graphs
- Upper total domination in claw-free cubic graphs
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
- Dominating set is fixed parameter tractable in claw-free graphs
- On Hamiltonicity of \{claw, net\}-free graphs
- Mock threshold graphs
- The feasibility problem for line graphs
- Hamiltonian line graphs with local degree conditions
- On cycle-nice claw-free graphs
- Minimal claw-free graphs
- On Hamiltonicity of regular graphs with bounded second neighborhoods
- More aspects of arbitrarily partitionable graphs
- Determining finite connected graphs along the quadratic embedding constants of paths
- Coloring graph classes with no induced fork via perfect divisibility
- Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path
- Declawing a graph: polyhedra and branch-and-cut algorithms
- 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
- On the independence number of traceable 2-connected claw-free graphs
- Padmakar-Ivan Index of Some Types of Perfect Graphs
- Improving upper bounds for the distinguishing index
- Equivalence of Jackson's and Thomassen's conjectures
- On the performance guarantee of first fit for sum coloring
- scientific article; zbMATH DE number 5844212 (Why is no real title available?)
- Mutual exclusion scheduling with interval graphs or related classes. II
- Full cycle extendability of locally connected \(K_{1,4}\)-restricted graphs
- Path extendability of claw-free graphs
- Free fermions behind the disguise
- On {claw, antenna, net}-free graphs
- Line graphs with a Cohen-Macaulay or Gorenstein clique complex
- Conjectures of TxGraffiti: independence, domination, and matchings
- Intersection graphs of non-crossing paths
- scientific article; zbMATH DE number 6302876 (Why is no real title available?)
- On local and global independence numbers of a graph
- On \(s\)-Hamiltonicity of net-free line graphs
This page was built for publication: Claw-free graphs---a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356695)
