On complexity of colouring mixed hypertrees

DOI10.1007/3-540-44669-9_58MaRDI QIDQ4782746zbMATH OpenFDO

Authors Daniel Král'

Publication date 2 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2138/21380516

zbMATH Keywords

hypertreemixed hypergraphpolynomial-time algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Coloring mixed hypertrees
• Coloring mixed hypertrees
• About uniquely colorable mixed hypertrees
• Complexity note on mixed hypergraphs
• On planar mixed hypergraphs

Cited in

(13)

• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
• Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types
• Mixed hypercacti
• Coloring mixed hypertrees
• Coloring mixed hypertrees
• Voloshin's conjecture for C-perfect hypertrees
• Maximum number of colors in hypertrees of bounded degree
• Color-bounded hypergraphs. V: Host graphs and subdivisions
• Complexity note on mixed hypergraphs
• scientific article; zbMATH DE number 6469177 (Why is no real title available?)
• On the complexity of some colorful problems parameterized by treewidth
• A note on mixed tree coloring
• Complexity of two coloring problems in cubic planar bipartite mixed graphs

This page was built for publication: On complexity of colouring mixed hypertrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4782746)