Susan Janiszewski

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
3-connected $\{K_{1,3},P_9\}$-free graphs are Hamiltonian-connected Graphs and Combinatorics	2014-09-19	Paper
On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users IEEE Transactions on Information Theory	2008-12-21	Paper

Research outcomes over time

This page was built for person: Susan Janiszewski

Publication	Date of Publication	Type
3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected Graphs and Combinatorics	2014-09-19	Paper
On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users IEEE Transactions on Information Theory	2008-12-21	Paper