A homomorphic polynomial for oriented graphs
From MaRDI portal
Recommendations
Cites work
- An introduction to chromatic polynomials
- Analogues of cliques for oriented coloring
- Chromatic Polynomials
- Chromatic polynomials of oriented graphs
- Colored homomorphisms of colored mixed graphs
- Good and semi-strong colorings of oriented planar graphs
- Homomorphisms and colourings of oriented graphs: an updated survey
- scientific article; zbMATH DE number 3748431 (Why is no real title available?)
- scientific article; zbMATH DE number 568836 (Why is no real title available?)
- scientific article; zbMATH DE number 758277 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Log-concavity of characteristic polynomials and the Bergman fan of matroids
- Minimal oriented graphs of diameter 2
- Oriented vertex and arc colorings of partial 2-trees
- Outerplanar and planar oriented cliques
- Pushable chromatic number of graphs with degree constraints
- The chromatic number of oriented graphs
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
Cited in
(4)
This page was built for publication: A homomorphic polynomial for oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692188)