OPG-46613
Open
L1
Partition of a cubic 3-connected graphs into paths of length 2.
Category:Graph Theory
Set:OpenGarden
Problem Statement
Background
About Graph Theory: Problems involving graphs, networks, and their properties.
Discussion (0)
No comments yet. Be the first to discuss this problem!
Sign in to start the conversation.
Checking sign-in status...