scientific article; zbMATH DE number 434912

zbMATH Open0791.05038MaRDI QIDQ3139768FDOQ3139768

P. Erdős, John Gimbel

Publication date: 28 June 1994

Title of this publication is not available (Why is that?)

zbMATH Keywords

complete graphcochromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Problem books (00A07)

Cited In (11)

• Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
• Fractional cocoloring of graphs
• Fixed-parameter algorithms for the cocoloring problem
• Critical 3-cochromatic graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximating minimum cocolorings.
• Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
• Some of My Favorite Coloring Problems for Graphs and Digraphs
• Some extremal results in cochromatic and dichromatic theory
• On a question of Erdős and Gimbel on the cochromatic number

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Chromatic number versus chromatic number in graphs with bounded clique number 👍 👎
• Subgraphs with a large cochromatic number 👍 👎
• Some topics in cochromatic theory 👍 👎

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 Q3139768)