Legal coloring of graphs
- 1 March 1986
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 6 (1) , 49-54
- https://doi.org/10.1007/bf02579408
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Acyclic orientations of graphsPublished by Elsevier ,2002
- The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- The Geometry of Root Systems and Signed GraphsThe American Mathematical Monthly, 1981
- Proving lower bounds for linear decision treesLecture Notes in Computer Science, 1981
- Information Bounds Are Weak in the Shortest Distance ProblemJournal of the ACM, 1980
- On the Polyhedral Decision ProblemSIAM Journal on Computing, 1980
- On the complexity of computations under varying sets of primitivesJournal of Computer and System Sciences, 1979
- Acyclic OrientationsPublished by Springer Nature ,1977