A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
Author:
- 30 November 1986
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 15 (2-3) , 123-134
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961