scientific article

zbMath0297.05107MaRDI QIDQ4050624

No author found.

Publication date: 1974

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (18)

Eternal domination and clique covering ⋮ On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs ⋮ The first and the second Zagreb indices of the generalized Mycielskian of graphs ⋮ Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) ⋮ Shannon capacity and the categorical product ⋮ Questions on color-critical subgraphs ⋮ Unnamed Item ⋮ On some generalized vertex Folkman numbers ⋮ On the triangle vertex Folkman numbers ⋮ On degree sums of a triangle-free graph ⋮ A characterization of the prime graphs of solvable groups. ⋮ A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth ⋮ On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number ⋮ The chromatic gap and its extremes ⋮ On common neighborhood graphs II ⋮ On atom-bond connectivity index of graphs ⋮ Partitioning graphs into complete and empty graphs ⋮ On 4-colorable robust critical graphs

This page was built for publication: