Chromatic index of graphs with no cycle with a unique chord
From MaRDI portal
Publication:2267844
Recommendations
- NP-completeness of edge-colouring some restricted graphs
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- Edge-coloring of split graphs.
- The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
- Complexity classification of the edge coloring problem for a family of graph classes
Cites work
- scientific article; zbMATH DE number 1463393 (Why is no real title available?)
- scientific article; zbMATH DE number 1472095 (Why is no real title available?)
- scientific article; zbMATH DE number 749267 (Why is no real title available?)
- scientific article; zbMATH DE number 927053 (Why is no real title available?)
- scientific article; zbMATH DE number 3273761 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- Characterizing and edge-colouring split-indifference graphs
- Classification and characterizations of snarks
- Colouring the petals of a graph
- Decompositions for edge-coloring join graphs and cobipartite graphs
- Decompositions for the edge colouring of reduced indifference graphs.
- Edge and total coloring of interval graphs
- Edge-colouring of join graphs
- Edge-colouring of regular graphs of large degree
- List edge and list total colourings of multigraphs
- NP completeness of finding the chromatic index of regular graphs
- NP-completeness of edge-colouring some restricted graphs
- Planar graphs of maximum degree seven are Class I
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- The NP-Completeness of Edge-Coloring
- The NP-completeness column: an ongoing guide
- The chromatic index of complete multipartite graphs
- Vertex colouring and forbidden subgraphs -- a survey
Cited in
(27)- Complexity-separating graph classes for vertex, edge and total colouring
- Total colorings-a survey
- When all minimal vertex separators induce complete or edgeless subgraphs
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- A new characterization of unichord-free graphs
- Total chromatic number of \{square,unichord\}-free graphs
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
- Edge colouring line graphs of unicyclic graphs
- The list chromatic index of simple graphs whose odd cycles intersect in at most one edge
- Even-power of cycles with many vertices are type 1 total colorable
- Requiring that minimal separators induce complete multipartite subgraphs
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
- Strongly unichord-free graphs
- Total tessellation cover: bounds, hardness, and applications
- The chromatic index of a graph whose core is a cycle of order at most 13
- Complexity separating classes for edge-colouring and total-colouring
- Edge-colouring and total-colouring chordless graphs
- Complexity classification of the edge coloring problem for a family of graph classes
- Characterizing k-chordal unichord-free graphs
- Two complexity results for the vertex coloring problem
- Total chromatic number of unichord-free graphs
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
- Using SPQR-trees to speed up recognition algorithms based on 2-cutsets
- New graph classes characterized by weak vertex separators and two-pairs
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- Compositions, decompositions, and conformability for total coloring on power of cycle graphs
This page was built for publication: Chromatic index of graphs with no cycle with a unique chord
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267844)
