Applications of edge coverings by cliques
- 1 January 1985
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 10 (1) , 93-109
Abstract
No abstract availableThis publication has 38 references indexed in Scilit:
- Some uniqueness results for upper boundDiscrete Mathematics, 1983
- I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applicationsNetworks, 1983
- OptimalI-Intersection assignments for graphs: A linear programming approachNetworks, 1983
- Clique coverings of graphs V: maximal-clique partitionsBulletin of the Australian Mathematical Society, 1982
- Graphs which, with their complements, have certain clique covering numbersDiscrete Mathematics, 1981
- A simple algorithm to detect balance in signed graphsMathematical Social Sciences, 1980
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- Scheduling of traffic lights—A new approachTransportation Research, 1968
- The zero error capacity of a noisy channelIEEE Transactions on Information Theory, 1956
- Structural balance: a generalization of Heider's theory.Psychological Review, 1956