scientific article; zbMATH DE number 7656024
From MaRDI portal
Publication:5878618
DOI10.33048/DAIO.2022.29.721MaRDI QIDQ5878618FDOQ5878618
Authors: Oleg Duginov, D. S. Malyshev 
Publication date: 21 February 2023
Full work available at URL: http://mathnet.ru/eng/da1297
Title of this publication is not available (Why is that?)
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
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Linear time solvable optimization problems on graphs of bounded clique-width
- The NP-Completeness of Edge-Coloring
- 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
- Coloring edges and vertices of graphs without short or long cycles
- Edge dominating set and colorings on graphs with fixed clique-width
- Line graphs of bounded clique-width
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classifying \(k\)-edge colouring for \(H\)-free graphs
- Complexity classification of the edge coloring problem for a family of graph classes
Cited In (3)
- The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices
- 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
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)
