On the \(s\)-hamiltonianicity of an hourglass-free line graph (Q2142636): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2022.112897 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4220772921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factors of 4-connected 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: 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: Edge-connectivity and edge-disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(s\)-Hamiltonian line graph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871030 / 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: Hamilton cycles in 5-connected line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 1-Hamilton-connected claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: All 4-connected line graphs of claw free graphs are Hamiltonian connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(s\)-Hamiltonian-connected line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On<i>s</i>-Hamiltonian Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian connectedness in 3-connected line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(s\)-Hamiltonian line graphs of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite 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: Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hamiltonian line graphs and connectivity / rank
 
Normal rank

Latest revision as of 03:40, 29 July 2024

scientific article
Language Label Description Also known as
English
On the \(s\)-hamiltonianicity of an hourglass-free line graph
scientific article

    Statements

    On the \(s\)-hamiltonianicity of an hourglass-free line graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 May 2022
    0 references
    fault-tolerant networks
    0 references
    polynomial algorithm
    0 references
    \(s\)-Hamiltonian graph
    0 references
    line graph
    0 references
    hourglass-free graph
    0 references

    Identifiers