On split-coloring problems
From MaRDI portal
Publication:995923
DOI10.1007/S10878-005-4103-7zbMATH Open1122.05077OpenAlexW1970548872MaRDI QIDQ995923FDOQ995923
Authors: Tınaz Ekim, Dominique De Werra 
Publication date: 10 September 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/88644/files/10878_2005_Article_4103.pdf
Recommendations
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Depth-First Search and Linear Graph Algorithms
- Threshold graphs and related topics
- Incidence matrices and interval graphs
- On rigid circuit graphs
- The splittance of a graph
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Partitioning chordal graphs into independent sets and cliques
- The complexity of some problems related to GRAPH 3-COLORABILITY
- Title not available (Why is that?)
- Split dimension of graphs
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Split graphs of Dilworth number 2
- A hypocoloring model for batch scheduling
Cited In (19)
- Split-critical and uniquely split-colorable graphs
- Sperner's Colorings, Hypergraph Labeling Problems and Fair Division
- Grundy coloring of special vertex split graphs
- Fixed-parameter algorithms for the cocoloring problem
- On local and semi-matching colorings of split graphs
- A finite basis characterization of alpha-split colorings
- Vertex deletion problems on chordal graphs
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
- On the splitting problem for selections
- Note on maximal split-stable subgraphs
- Vertex deletion problems on chordal graphs
- A tutorial on the use of graph coloring for some problems in robotics
- On colorings of split graphs
- Partitioning graphs into complete and empty graphs
- On the approximation of Min Split-coloring and Min Cocoloring
- Generalised online colouring problems in overlap graphs
- \((p,k)\)-coloring problems in line graphs
- Covering Graphs by Colored Stable Sets
- Partitioning cographs into cliques and stable sets
This page was built for publication: On split-coloring problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995923)
