Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd (Q3057083): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1002/jcd.20268 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jcd.20268 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2118469637 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114236277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path and cycle decompositions of complete equipartite graphs: Four parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of complete multipartite graphs into cycles of even length / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(C_{p}\)-decompositions of some regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposing \(K_n -I\) into cycles of a fixed odd length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete equipartite graphs into cycles of length2p / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3058999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle decompositions of complete multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete equipartite graphs into odd square-length cycles: number of parts even / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/JCD.20268 / rank
 
Normal rank

Latest revision as of 09:06, 20 December 2024

scientific article
Language Label Description Also known as
English
Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd
scientific article

    Statements

    Identifiers