(2026). On induced subgraphs of $H(n,3)$ with maximum degree $1$. Discrete Mathematics & Theoretical Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"On Induced Subgraphs of $H(n,3)$ with Maximum Degree $1$."
Discrete Mathematics & Theoretical Computer Science 2026.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"On Induced Subgraphs of $H(n,3)$ with Maximum Degree $1$."
Discrete Mathematics & Theoretical Computer Science, 2026.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.