Biclique-colouring verification complexity and biclique-colouring power graphs
From MaRDI portal
Publication:491598
DOI10.1016/j.dam.2014.05.001zbMath1319.05055arXiv1203.2543OpenAlexW78920299MaRDI QIDQ491598
Simone Dantas, Raphael C. S. Machado, Celina M. H. Figueiredo, Hélio B. Macêdo Filho
Publication date: 18 August 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.2543
Related Items (2)
On star and biclique edge-colorings ⋮ A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Powers of cycles, powers of paths, and distance graphs
- Complexity of clique coloring and related problems
- A result on the total colouring of powers of cycles
- Graph powers and \(k\)-ordered hamiltonicity
- On the chromatic number of circulant graphs
- Hardness results and spectral techniques for combinatorial problems on circulant graphs
- Pattern periodic coloring of distance graphs
- Triangle-free subgraphs of powers of cycles
- LexBFS-orderings and powers of chordal graphs
- Choosability of powers of circuits
- A fast algorithm for building lattices
- Distance graphs with finite chromatic number
- Colouring powers of cycles from random lists
- On independent sets and bicliques in graphs
- Independence and coloring properties of direct products of some vertex-transitive graphs
- On-line Ramsey Numbers
- Induced Subgraphs of the Power of a Cycle
- Complexity of clique-coloring odd-hole-free graphs
- Coloring the Maximal Cliques of Graphs
- On the complexity of bicoloring clique hypergraphs of graphs
- Biclique graphs and biclique matrices
- Node-and edge-deletion NP-complete problems
- The Star and Biclique Coloring and Choosability Problems
- On a problem of K. Zarankiewicz
- On the generation of bicliques of a graph
- Colouring clique-hypergraphs of circulant graphs
- Bicliques in graphs. I: Bounds on their number
This page was built for publication: Biclique-colouring verification complexity and biclique-colouring power graphs
