scientific article; zbMATH DE number 7656024
From MaRDI portal
Publication:5878618
Recommendations
- Complete complexity dichotomy for 7-edge forbidden subgraphs in the edge coloring problem
- The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices
- Complexity classification of the edge coloring problem for a family of graph classes
- Coloring graphs characterized by a forbidden subgraph
- Coloring graphs characterized by a forbidden subgraph
Cites work
- Classifying \(k\)-edge colouring for \(H\)-free graphs
- Coloring edges and vertices of graphs without short or long cycles
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity classification of the edge coloring problem for a family of graph classes
- Edge dominating set and colorings on graphs with fixed clique-width
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- scientific article; zbMATH DE number 1979486 (Why is no real title available?)
- Line graphs of bounded clique-width
- Linear time solvable optimization problems on graphs of bounded clique-width
- On the Relationship Between Clique-Width and Treewidth
- The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices
- The NP-Completeness of Edge-Coloring
Cited in
(3)- Complete complexity dichotomy for 7-edge forbidden subgraphs in the edge coloring problem
- A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs
- The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5878618)
