Total chromatic number of \{square,unichord\}-free graphs
From MaRDI portal
Publication:2883635
DOI10.1016/J.ENDM.2010.05.085zbMATH Open1236.05084OpenAlexW1999082207MaRDI QIDQ2883635FDOQ2883635
Authors: R. C. S. Machado, Celina M. H. de Figueiredo 
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.085
Recommendations
- Total chromatic number of unichord-free graphs
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
- Complexity separating classes for edge-colouring and total-colouring
- Chromatic index of graphs with no cycle with a unique chord
- Clique-colouring and biclique-colouring unichord-free graphs
decompositionrecognitionPetersen graphedge-colouringtotal-colouringHeawood graphcycle with a unique chord
Cites Work
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colourings of graphs
- Total chromatic number of one kind of join graphs
- On the total coloring of certain graphs
- Total chromatic number of planar graphs with maximum degree ten
- On Total Chromatic Number of a Graph
- Determining the total colouring number is NP-hard
- The total coloring of a multigraph with maximal degree 4
- Total colouring regular bipartite graphs is NP-hard
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
- The total chromatic number of some bipartite graphs.
- Total 4-choosability of series-parallel graphs
- Edge and total choosability of near-outerplanar graphs
- Title not available (Why is that?)
Cited In (9)
- Clique-colouring and biclique-colouring unichord-free graphs
- THE UNIQUE EQUIVALENCE CLASS OF CHROMATIC RECTANGLE FREE 3-COLORINGS OF A 10 × 10 CHESSBOARD
- Total colorings-a survey
- Complexity separating classes for edge-colouring and total-colouring
- Total chromatic number of unichord-free graphs
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
- Complexity-separating graph classes for vertex, edge and total colouring
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
This page was built for publication: Total chromatic number of \{square,unichord\}-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883635)
