On \(( s , t )\)-supereulerian graphs with linear degree bounds (Q2222943): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3757937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spanning subgraphs of eulerian 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: Supereulerian graphs: A survey / 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: Q5502386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trails containing given edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collapsible subgraphs of a 4-edge-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian subgraphs containing given edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (s,t)-supereulerian graphs in locally highly connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on edge-disjoint spanning trees and eigenvalues / 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: A note on graphs spanned by Eulerian graphs / 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: Spanning trails in essentially 4-edge-connected graphs / rank
 
Normal rank

Revision as of 10:29, 24 July 2024

scientific article
Language Label Description Also known as
English
On \(( s , t )\)-supereulerian graphs with linear degree bounds
scientific article

    Statements

    On \(( s , t )\)-supereulerian graphs with linear degree bounds (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 January 2021
    0 references
    edge-connectivity
    0 references
    closed trails
    0 references
    supereulerian graphs
    0 references
    \( ( s
    0 references
    t )\)-supereulerian
    0 references
    collapsible graphs
    0 references
    reduction
    0 references

    Identifiers