How is a chordal graph like a supersolvable binary matroid?

Raul Cordovil, David Forge, Sulamita Klein. How is a chordal graph like a supersolvable binary matroid?. Discrete Mathematics, 288(1-3):167-172, 2004. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.