The cyclic matching sequenceability of regular graphs (Q6056787): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3514485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Matching Sequencibility of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on upper and lower bounds formatching sequencibility of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions via Hamiltonian theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5245536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(r\)-matching sequencibility of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solution of a Timetabling Problem / rank
 
Normal rank

Revision as of 02:28, 3 August 2024

scientific article; zbMATH DE number 7745247
Language Label Description Also known as
English
The cyclic matching sequenceability of regular graphs
scientific article; zbMATH DE number 7745247

    Statements

    The cyclic matching sequenceability of regular graphs (English)
    0 references
    0 references
    0 references
    4 October 2023
    0 references
    chromatic index
    0 references
    edge ordering
    0 references
    matching
    0 references
    matching sequenceability
    0 references

    Identifiers