Almost Eulerian compatible spanning circuits in edge-colored graphs (Q2219966): 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: Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720644 / 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: Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs / 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: Q3286850 / 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: Q3972517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Plane Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compatible spanning circuits in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and edge-disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees and spanning Eulerian subgraphs with small degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538410 / 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: Disjoint Hamilton cycles in the random geometric graph / 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
Property / cites work
 
Property / cites work: Q3089373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Hamiltonian cycles in fan 2<i>k</i>‐type graphs / rank
 
Normal rank

Latest revision as of 08:55, 24 July 2024

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

    Statements

    Almost Eulerian compatible spanning circuits in edge-colored graphs (English)
    0 references
    21 January 2021
    0 references
    edge-colored graph
    0 references
    supereulerian graph
    0 references
    compatible spanning circuit
    0 references
    fan-type degree condition
    0 references
    random graph
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers