Spanning trails in essentially 4-edge-connected graphs (Q741753): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2013.08.041 / 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: Graphs without spanning closed trails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supereulerian graphs and the Petersen graph / 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: A Note on Sub-Eulerian Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supereulerian graphs in the graph family \(C_{2}(6,k)\) / 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: Spanning trails containing given edges / 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: Reflections on graph theory / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2013.08.041 / rank
 
Normal rank

Latest revision as of 02:44, 10 December 2024

scientific article
Language Label Description Also known as
English
Spanning trails in essentially 4-edge-connected graphs
scientific article

    Statements

    Spanning trails in essentially 4-edge-connected graphs (English)
    0 references
    0 references
    12 September 2014
    0 references
    collapsible
    0 references
    essentially 4-edge-connected
    0 references
    \(r\)-edge-Eulerian-connected
    0 references
    spanning trail
    0 references

    Identifiers