New<i>i</i>-Perfect Cycle Decompositions via Vertex Colorings of Graphs (Q2957063): 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/jcd.21511 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2258081957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(i\)-perfect \(m\)-cycle systems, \(m\leq 19\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle decompositions of \(K_n\) and \(K_n-I\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly transitive 2-factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotational <i>k</i>‐cycle systems of order <i>v</i> &lt; 3<i>k</i>; another proof of the existence of odd cycle systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong difference families over arbitrary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some constructions for cyclic perfect cycle systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on 1‐Rotational Hamiltonian Cycle Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectrum for 2-perfect 6-cycle systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-perfect \(m\)-cycle systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4046212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle decompositions III: Complete graphs and fixed length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete equipartite graphs into short odd cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete equipartite graphs into short even cycles / rank
 
Normal rank

Latest revision as of 08:29, 13 July 2024

scientific article
Language Label Description Also known as
English
New<i>i</i>-Perfect Cycle Decompositions via Vertex Colorings of Graphs
scientific article

    Statements

    New<i>i</i>-Perfect Cycle Decompositions via Vertex Colorings of Graphs (English)
    0 references
    0 references
    0 references
    0 references
    20 January 2017
    0 references
    \(i\)-perfect cycle decomposition
    0 references
    group action
    0 references
    vertex coloring
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references