Compatible spanning circuits in edge-colored graphs (Q2182217): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4358434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supereulerian graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Hamiltonian cycles having adjacent lines different colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with cycles having adjacent lines different colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: New sufficient conditions for cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly colored paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chinese postman problem on edge-colored multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of r-partite graphs into edge-disjoint Hamilton circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly coloured Hamiltonian cycles in edge-coloured complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / 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: A property of the colored complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Orderly Colored Longest Path Problem – a survey of applications and new algorithms / rank
 
Normal rank

Latest revision as of 18:34, 22 July 2024

scientific article
Language Label Description Also known as
English
Compatible spanning circuits in edge-colored graphs
scientific article

    Statements

    Compatible spanning circuits in edge-colored graphs (English)
    0 references
    21 May 2020
    0 references
    edge-colored graph
    0 references
    spanning Eulerian subgraph
    0 references
    supereulerian graph
    0 references
    compatible spanning circuit
    0 references
    ore-type degree condition
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers