On chromaticity of hypergraphs (Q878636): Difference between revisions

The authors consider an extension of the chromatic polynomial to hypergraphs and prove that uniform hypertrees and uniform unicyclic hypergraphs are chromatically characterized in the class of linear hypergraphs.

0 references

reviewed by

Klaus Dohmen

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

chromatic polynomial

0 references

hypergraph

0 references

hypertree

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disc.2005.11.079

0 references

0 references

0 references

Chromatic polynomials of hypergraphs

0 references

On chromatic equivalence of graphs

0 references

A broken-circuits-theorem for hypergraphs

0 references

Q4860309

0 references

On chromaticity of graphs

0 references

Chromatic coefficients of linear uniform hypergraphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:878636

@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic polynomials of hypergraphs
@@ Property / cites work: Chromatic polynomials of hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On chromatic equivalence of graphs
@@ Property / cites work: On chromatic equivalence of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A broken-circuits-theorem for hypergraphs
@@ Property / cites work: A broken-circuits-theorem for hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4860309
@@ Property / cites work: Q4860309 / rank @@
+Normal rank
@@ Property / cites work @@
+On chromaticity of graphs
@@ Property / cites work: On chromaticity of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic coefficients of linear uniform hypergraphs
+Normal rank