Fractional cocoloring of graphs

DOI10.1007/s00373-022-02463-5zbMath1485.05059arXiv1906.05504OpenAlexW2949295139MaRDI QIDQ2117529

Yanyan Li

Publication date: 21 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.05504

zbMATH Keywords

fractional coloringcocoloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
• Extending the Gyárfás-Sumner conjecture
• Kneser's conjecture, chromatic number, and homotopy
• The ellipsoid method and its consequences in combinatorial optimization
• Advances on defective parameters in graphs
• Critical 3-cochromatic graphs
• Fixed-parameter algorithms for the cocoloring problem
• Chromatic number versus chromatic number in graphs with bounded clique number
• Cliques and stable sets in undirected graphs
• Critically cochromatic graphs
• Some extremal results in cochromatic and dichromatic theory
• Two Results Concerning Multicoloring
• Cochromatic Number and the Genus of a Graph
• Note on the cochromatic number of several surfaces
• Subgraphs with a large cochromatic number
• Coloring graphs with fixed genus and girth
• The fractional chromatic number of mycielski's graphs
• Fractional colorings with large denominators
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• The chromatic number of random graphs

This page was built for publication: Fractional cocoloring of graphs