The core of a graph
- 1 November 1992
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 109 (1-3), 117-126
- https://doi.org/10.1016/0012-365x(92)90282-k
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Endomorphisms of graphs II. Various unretractive graphsArchiv der Mathematik, 1990
- On the complexity of H-coloringJournal of Combinatorial Theory, Series B, 1990
- The effect of two cycles on the complexity of colourings by directed graphsDiscrete Applied Mathematics, 1990
- Chromatically optimal rigid graphsJournal of Combinatorial Theory, Series B, 1989
- The Complexity of Colouring by Semicomplete DigraphsSIAM Journal on Discrete Mathematics, 1988
- Unretractive and S-unretractive joins and lexicographic products of graphsJournal of Graph Theory, 1987
- On minimal graphsTheoretical Computer Science, 1982
- Fixed-edge theorem for graphs with loopsJournal of Graph Theory, 1979
- Cohomomorphisms of graphs and hypergraphsMathematische Nachrichten, 1979
- Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)Canadian Journal of Mathematics, 1973