Hamiltonicity of claw-free graphs and Fan-type conditions (Q1727781): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2018.12.008 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2018.12.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2910300564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction method to find spanning Eulerian subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs without spanning closed trails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree and neighborhood conditions for Hamiltonicity of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity and Degrees of Adjacent Vertices in Claw‐Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5740779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New sufficient conditions for cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Eulerian and Hamiltonian Graphs and Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost claw‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a closure concept in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dominating and spanning circuits in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2018.12.008 / rank
 
Normal rank

Revision as of 06:06, 11 December 2024

scientific article
Language Label Description Also known as
English
Hamiltonicity of claw-free graphs and Fan-type conditions
scientific article

    Statements

    Hamiltonicity of claw-free graphs and Fan-type conditions (English)
    0 references
    0 references
    20 February 2019
    0 references
    Hamiltonicity
    0 references
    obstruction set
    0 references
    claw-free graph
    0 references
    Catlin's reduction method
    0 references
    Fan-type condition
    0 references

    Identifiers