scientific article; zbMATH DE number 434912

zbMATH Open0791.05038MaRDI QIDQ3139768FDOQ3139768

Authors: John Gimbel, P. Erdős 

Publication date: 28 June 1994

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

Recommendations

• Publication:4722090
• scientific article; zbMATH DE number 3999957
• Some topics in cochromatic theory
• Subgraphs with a large cochromatic number
• Chromatic number versus chromatic number in graphs with bounded clique number

zbMATH Keywords

complete graphcochromatic number

Mathematics Subject Classification ID

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

Cited In (16)

• Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
• Some of my favorite coloring problems for graphs and digraphs
• Fractional cocoloring of graphs
• Fixed-parameter algorithms for the cocoloring problem
• Critical 3-cochromatic graphs
• A lower bound on cochromatic number for line graphs of a kind of graphs
• Some topics in cochromatic theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximating minimum cocolorings.
• Cliques and stable sets in undirected graphs
• Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
• Some extremal results in cochromatic and dichromatic theory
• Title not available (Why is that?)
• On a question of Erdős and Gimbel on the cochromatic number

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)