On split-coloring problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1803762 (Why is no real title available?)
- A hypocoloring model for batch scheduling
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Depth-First Search and Linear Graph Algorithms
- Incidence matrices and interval graphs
- On rigid circuit graphs
- Partitioning chordal graphs into independent sets and cliques
- Split dimension of graphs
- Split graphs of Dilworth number 2
- The complexity of some problems related to GRAPH 3-COLORABILITY
- The splittance of a graph
- Threshold graphs and related topics
Cited in
(19)- Note on maximal split-stable subgraphs
- On local and semi-matching colorings of split graphs
- Vertex deletion problems on chordal graphs
- A tutorial on the use of graph coloring for some problems in robotics
- Generalised online colouring problems in overlap graphs
- On colorings of split graphs
- On the splitting problem for selections
- \((p,k)\)-coloring problems in line graphs
- Partitioning graphs into complete and empty graphs
- Vertex deletion problems on chordal graphs
- Sperner's Colorings, Hypergraph Labeling Problems and Fair Division
- Grundy coloring of special vertex split graphs
- Split-critical and uniquely split-colorable graphs
- Covering Graphs by Colored Stable Sets
- A finite basis characterization of alpha-split colorings
- Fixed-parameter algorithms for the cocoloring problem
- Partitioning cographs into cliques and stable sets
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
- On the approximation of Min Split-coloring and Min Cocoloring
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)
