scientific article; zbMATH DE number 932194

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199610)23:2<151::AID-JGT6>3.0.CO;2-S" /><151::AID-JGT6>3.0.CO;2-S 10.1002/(SICI)1097-0118(199610)23:2<151::AID-JGT6>3.0.CO;2-SzbMath0858.05045MaRDI QIDQ4894618

Jaroslav Nešetřil, Xuding Zhu

Publication date: 7 October 1996

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

zbMATH Keywords

directed graphstreewidth duality\(H\)-coloring problem

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Unnamed Item ⋮ Colorings and girth of oriented planar graphs ⋮ On the density of \(C_7\)-critical graphs ⋮ Graphs with bounded tree-width and large odd-girth are almost bipartite ⋮ Fractional coloring planar graphs under Steinberg-type conditions ⋮ On digraph coloring problems and treewidth duality ⋮ Homomorphisms from sparse graphs with large girth. ⋮ On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters ⋮ On the density of \(C_7\)-critical graphs ⋮ Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems ⋮ On universal graphs for planar oriented graphs of a given girth ⋮ High-girth graphs avoiding a minor are nearly bipartite

This page was built for publication: