1 problem

0 votes0 replies0 views
Smallest non-regular bipartite polyhedral transmission-regular graph conjecture
Smallest-graph conjecture. The graph $G_{RD}$ is the smallest non-regular, bipartite, polyhedral (3-connected), and transmission regular graph.
Conjectureopengraph-theory polyhedral-graphs transmission-regular-graphsarXiv posted 2 days ago

Smallest non-regular bipartite polyhedral transmission-regular graph conjecture