On 3-edge-connected supereulerian graphs (Q659686): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1007/s00373-010-0974-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030148137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spanning subgraphs of eulerian graphs / 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: A Note on Sub-Eulerian 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 a closure concept in 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 hamiltonian line graphs and connectivity / rank
 
Normal rank

Latest revision as of 21:22, 4 July 2024

scientific article
Language Label Description Also known as
English
On 3-edge-connected supereulerian graphs
scientific article

    Statements

    On 3-edge-connected supereulerian graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 January 2012
    0 references
    supereulerian graphs
    0 references
    spanning eulerian subgraph
    0 references
    line graph
    0 references
    3-edge-connected graph
    0 references
    4-edge-connected graph
    0 references
    5-edge-connencted graph
    0 references

    Identifiers