Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:3188969
Jump to:navigation, search

zbMath1301.05003MaRDI QIDQ3188969

Marc Thurley

Publication date: 9 September 2014


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexitygraph homomorphisms


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)


Related Items (4)

Perfect matchings, rank of connection tensors and graph homomorphisms ⋮ A dichotomy for bounded degree graph homomorphisms with nonnegative weights ⋮ The complexity of planar Boolean \#CSP with complex weights ⋮ A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3188969&oldid=16287798"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki