"Maximizing the Number of H-Colorings of Graphs with a Fixed Minimum Degree."

John Engbers (2024)

> Home

Details and statistics

DOI: 10.1007/S00373-024-02854-W

access: closed

type: Journal Article

metadata version: 2024-12-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gc/Engbers24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/Engbers24
John Engbers:
Maximizing the Number of H-Colorings of Graphs with a Fixed Minimum Degree. Graphs Comb. 40(6): 121 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.