Chromatic neighborhood sets
From MaRDI portal
Publication:4261186
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199908)31:4<303::AID-JGT5>3.0.CO;2-G" /><303::AID-JGT5>3.0.CO;2-G 10.1002/(SICI)1097-0118(199908)31:4<303::AID-JGT5>3.0.CO;2-GzbMath0940.05028OpenAlexW4253310538MaRDI QIDQ4261186
No author found.
Publication date: 19 July 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199908)31:4<303::aid-jgt5>3.0.co;2-g
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (5)
Extremal problems for chromatic neighborhood sets ⋮ Point partition numbers: decomposable and indecomposable critical graphs ⋮ Minimal connected \(\tau\)-critical hypergraphs ⋮ (\(\Delta-k\))-critical graphs ⋮ Hajós and Ore constructions for digraphs
Cites Work
This page was built for publication: Chromatic neighborhood sets
