Extremal graphs for homomorphisms. II
From MaRDI portal
Recommendations
Cites work
- An entropy approach to the hard-core model on bipartite graphs
- Backtrack: An O(1) expected time algorithm for the graph coloring problem
- Extremal graphs for homomorphisms
- Extremal problems for independent set enumeration
- Graph homomorphisms and phase transitions
- Legal coloring of graphs
- Maximizing the number of q -colorings
- The number of independent sets in a regular graph
Cited in
(13)- Graph vulnerability parameters, compression, and quasi-threshold graphs
- Homomorphisms into loop-threshold graphs
- Graph vulnerability parameters, compression, and threshold graphs
- Extremal graphs for the Tutte polynomial
- The maximum number of complete subgraphs of fixed size in a graph with given maximum degree
- On a certain homomorphism properties of graphs II.
- Enumerating threshold graphs and some related graph classes
- Extremal graphs for homomorphisms
- Extremal H‐Colorings of Graphs with Fixed Minimum Degree
- Homomorphisms of trees into a path
- Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
- Threshold graphs maximise homomorphism densities
- On topological indices, graph compression, and threshold graphs
This page was built for publication: Extremal graphs for homomorphisms. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418768)