On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5925555)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7538592
Language Label Description Also known as
default for all languages
No label defined
    English
    On 3-coloring of \((2P_4,C_5)\)-free graphs
    scientific article; zbMATH DE number 7538592

      Statements

      On 3-coloring of \((2P_4,C_5)\)-free graphs (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      8 June 2022
      0 references
      3-coloring
      0 references
      hereditary classes
      0 references
      \(2P_4\)-free graphs
      0 references
      cographs
      0 references
      0 references

      Identifiers