Homomorphically full graphs

DOI10.1016/0166-218X(94)00134-YzbMath0856.05093OpenAlexW1972219002WikidataQ126399701 ScholiaQ126399701MaRDI QIDQ1917297

Gary MacGillivray, Richard C. Brewster

Publication date: 7 July 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00134-y

zbMATH Keywords

characterizationsrigid graphsrecognition algorithmscoreshomomorphically full graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The core of a graph
• On the complexity of H-coloring
• The chromatic connectivity of graphs
• Chromatically optimal rigid graphs
• Complement reducible graphs
• On minimal graphs
• Color-families are dense
• Graph with given achromatic number
• On a class of posets and the corresponding comparability graphs
• Trivially perfect graphs
• Parallel concepts in graph theory
• Achromatic number is NP-complete for cographs and interval graphs
• Symmetric relations (undirected graphs) with given semigroups
• Absolute planar retracts and the four colour conjecture
• Absolute Retracts and Varieties of Reflexive Graphs
• Unretractive and S-unretractive joins and lexicographic products of graphs
• The Complexity of Colouring by Semicomplete Digraphs
• The Comparability Graph of a Tree
• Fixed-edge theorem for graphs with loops
• Constant Time Generation of Rooted Trees
• A Note on "The Comparability Graph of a Tree"
• On Rigid Undirected Graphs
• Graphs and k-Societies
• Products of absolute retracts

This page was built for publication: Homomorphically full graphs