Claw-free graphs---a survey (Q1356695): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ralph J. Faudree / rank
Normal rank
 
Property / author
 
Property / author: Ralph J. Faudree / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q55952667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3201099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and factorizations of graphs—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination and independent domination numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monotone circuit complexity of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs satisfying a local ore-type condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some localization theorems on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3781786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cycles in bipartite biclaw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian properties of graphs with large neighborhood unions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5570136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of derived graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge Hamiltonian path problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic parameters concerning domination, independence, and irredundance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3781785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of Δλ-cycles and Δλ-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long paths and cycles in tough graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through particular subgraphs of claw‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and hamiltonicity in almost claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(K_ 4\)-closures in hamiltonian graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on locally connected and Hamiltonian-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity for <i>K</i><sub>1, r</sub>‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2788176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4030533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CHROMATIC BOUNDS FOR A CLASS OF GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular factors in <i>K</i><sub>1,3</sub>‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which claw-free graphs are perfectly orderable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3958496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4030543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability number of bull- and chair-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of a graph with two forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular factors in <i>K</i><sub>1,<i>n</i></sub> free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw‐free graphs are edge reconstructible / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized degree conditions for graphs with bounded independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions and cycle extendability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3363384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability, domination and irredundance in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity of bipartite biclaw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclism in hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonism, degree sum and neighborhood intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mengerian properties, hamiltonicity, and claw‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strengthening of Ben Rebea's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new sufficient condition for hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the characterization of domination perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On claw-freeM-oriented critical kernel-imperfect digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable set polyhedra for K//(1,3)free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4713091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for a graph to be Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating the hamiltonian problem—A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs and Hamiltonian properties and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs and hamiitonian properties in the square of a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numbers of independent \(k\)-sets in a claw free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in CAN-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The struction of a graph: Application to CN-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with Hamiltonian square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of a connected S(K1,3)-free graph is vertex pancyclic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability number of AH‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How To Color Claw-Free Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4887685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in regular 2-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Choudum's “chromatic bounds for a class of graphs” / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: an ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partitioning the edges of graphs into connected subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected, locally 2-connected,K1,3-free graphs are panconnected / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cube of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic index of multigraphs without large triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of edge coloring of multigraphs to vertex coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of Vizing's theorem to vertex colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the edge-reconstruction of \(K_{1,m}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in 2‐connected claw‐free‐graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity in 2-connected graphs with claws / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4030544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4030547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in 3‐connected claw‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest cycles in regular 2-connected claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2713659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4030562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3734438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles in star-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest paths and cycles in K1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3665799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some sufficient conditions for the existence of a 1-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of 1-factors in partial squares of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3988774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every connected, locally connected nontrivial graph with no induced claw is hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph conjecture for pan-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3812277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3469132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending matchings in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4025529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in <i>N</i><sub>2</sub>‐locally connected <i>K</i><sub>1,3</sub>‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost claw‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity in claw-free graphs through induced bulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5728984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2‐neighborhoods and hamiltonian conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden induced subgraphs for line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4022066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with 1-Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Factors and Antifactor Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5288887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with equal domination and independent domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of dominating cycles and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4030546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its Anderson number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of given length in some \(K_{1,3}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of domination perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hamiltonian line graphs and connectivity / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(96)00045-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092366448 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:17, 30 July 2024

scientific article
Language Label Description Also known as
English
Claw-free graphs---a survey
scientific article

    Statements

    Claw-free graphs---a survey (English)
    0 references
    0 references
    0 references
    0 references
    13 July 1997
    0 references
    survey
    0 references
    claw-free graphs
    0 references
    cycles
    0 references
    hamiltonicity
    0 references
    factors
    0 references
    domination
    0 references
    invariants
    0 references
    extremal problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references