Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
From MaRDI portal
Publication:521809
DOI10.1007/S00453-015-0106-7zbMATH Open1359.05043OpenAlexW2226560684MaRDI QIDQ521809FDOQ521809
Authors: Hélio B. Macêdo Filho, R. C. S. Machado, Celina M. H. de Figueiredo 
Publication date: 12 April 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-0106-7
Recommendations
- Clique-colouring and biclique-colouring 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
- Total chromatic number of unichord-free graphs
- Total chromatic number of \{square,unichord\}-free graphs
Cites Work
- Title not available (Why is that?)
- Depth-First Search and Linear Graph Algorithms
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
- The NP-Completeness of Edge-Coloring
- The strong perfect graph theorem
- Node-and edge-deletion NP-complete problems
- Total chromatic number of unichord-free graphs
- Title not available (Why is that?)
- Biclique graphs and biclique matrices
- Total colouring regular bipartite graphs is NP-hard
- On independent sets and bicliques in graphs
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- Complexity of clique coloring and related problems
- The NP-completeness column: an ongoing guide
- Chromatic index of graphs with no cycle with a unique chord
- Coloring the Maximal Cliques of Graphs
- Bicliques in graphs. I: Bounds on their number
- Generating bicliques of a graph in lexicographic order
- On the generation of bicliques of a graph
- On the complexity of bicoloring clique hypergraphs of graphs
- A fast algorithm for building lattices
- Clique-colouring and biclique-colouring unichord-free graphs
- Complexity of clique-coloring odd-hole-free graphs
- The Star and Biclique Coloring and Choosability Problems
- Total chromatic number of \{square,unichord\}-free graphs
- A fast incremental algorithm for building lattices
- Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs
Cited In (6)
- Clique-colouring and biclique-colouring unichord-free graphs
- Total chromatic number of unichord-free graphs
- Title not available (Why is that?)
- Biclique-colouring verification complexity and biclique-colouring power graphs
- Complexity-separating graph classes for vertex, edge and total colouring
- Biclique graphs of split graphs
This page was built for publication: Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521809)
