The overfull conjecture on split-comparability and split-interval graphs
From MaRDI portal
Publication:6048434
DOI10.1016/j.dam.2023.06.040zbMath1527.05064OpenAlexW4385369586WikidataQ123250150 ScholiaQ123250150MaRDI QIDQ6048434
Sheila Morais de Almeida, Luis Gustavo da Soledade Gonzaga, Cândida Nunes da Silva, Jadder Bismarck de Sousa Cruz
Publication date: 14 September 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.06.040
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total-chromatic number and chromatic index of dually chordal graphs
- The chromatic index of graphs with large maximum degree
- Decompositions for edge-coloring join graphs and cobipartite graphs
- Characterizing and edge-colouring split-indifference graphs
- Complexity-separating graph classes for vertex, edge and total colouring
- On colorings of split graphs
- The NP-completeness column: an ongoing guide
- Graphs which are vertex-critical with respect to the edge-chromatic number
- The chromatic index of graphs with a spanning star
- The NP-Completeness of Edge-Coloring
- The chromatic index of complete multipartite graphs
- The chromatic index of graphs of even order with many edges
- A Characterization of Comparability Graphs and of Interval Graphs
- Edge and total coloring of interval graphs
This page was built for publication: The overfull conjecture on split-comparability and split-interval graphs