Ore-type conditions for the existence of even \([2,b]\)-factors in graphs (Q2576834): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On circuits and pancyclic line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning 2‐trails from degree sum conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type condition for the existence of \(k\)-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Spanning and Dominating Circuits in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The factorization of graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank

Latest revision as of 13:29, 11 June 2024

scientific article
Language Label Description Also known as
English
Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
scientific article

    Statements

    Ore-type conditions for the existence of even \([2,b]\)-factors in graphs (English)
    0 references
    0 references
    29 December 2005
    0 references
    trail
    0 references
    cycle
    0 references

    Identifiers