Spanning subgraph with Eulerian components (Q764890): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q3808129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3791179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The upper bound of the number of cycles in a 2-factor of a line graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even subgraphs of bridgeless graphs and 2-factors of line graphs / 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: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of even factors in claw-free graphs / rank
 
Normal rank

Latest revision as of 00:40, 5 July 2024

scientific article
Language Label Description Also known as
English
Spanning subgraph with Eulerian components
scientific article

    Statements

    Identifiers