Circumferences of 3-connected claw-free graphs (Q267172): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2016.01.018 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2016.01.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2277080743 / 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: Fan-type conditions for spanning Eulerian subgraphs / 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: On Eulerian and Hamiltonian Graphs and Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity in 3-connected claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumferences and minimum degrees in 3-connected claw-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: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / 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: Q4141844 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2016.01.018 / rank
 
Normal rank

Latest revision as of 12:54, 9 December 2024

scientific article
Language Label Description Also known as
English
Circumferences of 3-connected claw-free graphs
scientific article

    Statements

    Identifiers

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