Advances on defective parameters in graphs
From MaRDI portal
Publication:1751109
DOI10.1016/j.disopt.2015.01.002zbMath1387.05077OpenAlexW1998626406MaRDI QIDQ1751109
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2015.01.002
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (4)
Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs ⋮ Small 1-defective Ramsey numbers in perfect graphs ⋮ Exact values of defective Ramsey numbers in graph classes ⋮ Fractional cocoloring of graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A tutorial on the use of graph coloring for some problems in robotics
- Partitioning graphs into complete and empty graphs
- On cocolourings and cochromatic numbers of graphs
- All Ramsey numbers \(r(K_ 3,G)\) for connected graphs of order 9
- Small Ramsey numbers
- Critical 3-cochromatic graphs
- Some defective parameters in graphs
- Ramsey numbers \(R(K_3, G)\) for graphs of order 10
- Partitioning cographs into cliques and stable sets
- Ramsey Numbers for Line Graphs and Perfect Graphs
- Defective coloring revisited
- Some extremal results in cochromatic and dichromatic theory
- On 1-dependent ramsey numbers for graphs
- On subgraphs without large components
This page was built for publication: Advances on defective parameters in graphs