Characterization of forbidden subgraphs for the existence of even factors in a graph (Q2030443): 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.dam.2017.02.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2593770371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs and the existence of a 2-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing forbidden pairs for hamiltonian properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The upper bound of the number of cycles in a 2-factor of a line graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supereulerian graphs and excluded induced minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian index is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of even factors in iterated line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-factors with the bounded number of components in line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian index of a graph and its branch-bonds / rank
 
Normal rank

Latest revision as of 21:44, 25 July 2024

scientific article
Language Label Description Also known as
English
Characterization of forbidden subgraphs for the existence of even factors in a graph
scientific article

    Statements

    Characterization of forbidden subgraphs for the existence of even factors in a graph (English)
    0 references
    7 June 2021
    0 references
    even factor
    0 references
    forbidden graph
    0 references
    chair-free graph
    0 references
    claw-free graph
    0 references
    branch bond
    0 references
    0 references

    Identifiers