scientific article; zbMATH DE number 3981199
From MaRDI portal
Publication:3745860
[For the entire collection see Zbl 0587.00006.] The author presents some new results on the chromatic length of a graph [for the definition see \textit{M. C. Golumbic}: Algorithmic graph theory and perfect graphs (1980; Zbl 0541.05054)], generalizing thereby some known results on the chromatic number.
Recommendations
Cited in
(8)- scientific article; zbMATH DE number 4010540 (Why is no real title available?)
- On graphs with restricted link graphs and the chromatic number at most $3$
- scientific article; zbMATH DE number 54806 (Why is no real title available?)
- scientific article; zbMATH DE number 3468845 (Why is no real title available?)
- A generalization of Gale's lemma
- Estimates of coefficients of chromatic polynomials and numbers of cliques of (c,n,m)-graphs
- Chromatic number, edge chromatic number of expansion graphs of graphs
- Some generalizations of theorems on vertex coloring
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745860)