On even circuit decompositions of eulerian graphs (Q4277987): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.3190180106 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2156114360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with the Circuit Cover Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circuit decomposition of planar Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit decompositions of Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even circuits in planar graphs / rank
 
Normal rank

Latest revision as of 12:37, 22 May 2024

scientific article; zbMATH DE number 490726
Language Label Description Also known as
English
On even circuit decompositions of eulerian graphs
scientific article; zbMATH DE number 490726

    Statements

    On even circuit decompositions of eulerian graphs (English)
    0 references
    0 references
    9 January 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    even cycle
    0 references
    eulerian graph
    0 references
    eulerian multigraph
    0 references
    edge decomposition
    0 references
    0 references