Decomposition of complete graphs into factors of diameter two and three

DOI10.7151/DMGT.1184zbMATH Open1035.05071OpenAlexW1996703203MaRDI QIDQ4458969FDOQ4458969

Damir Vukičević

Publication date: 25 March 2004

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/fa4904f13b393a31a2f9c23c866ed7e54d64243e

Recommendations

• scientific article; zbMATH DE number 1874581
• scientific article; zbMATH DE number 9993
• scientific article; zbMATH DE number 9573
• scientific article
• Decompositions of complete graphs into three factors

zbMATH Keywords

graph decompositiongraph diameter

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Mix-decomposition of the complete graph into directed factors of diameter 2 and undirected factors of diameter 3
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Decomposition of complete graphs into factors of diameter two and three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458969)