On star and biclique edge-colorings (original) (raw)
Related papers
The Star and Biclique Coloring and Choosability Problems
Journal of Graph Algorithms and Applications, 2014
Conflict-Free Coloring of Graphs
SIAM Journal on Discrete Mathematics
On the complexity of colouring by superdigraphs of bipartite graphs
Discrete Mathematics, 1992
Biclique edge-choosability in some classes of graphs∗
Anais do Encontro de Teoria da Computação (ETC)
ON EDGE COLORING BIPARTITE GRAPHS
The Complexity of some Problems Related to Graph 3-colorability
Discrete Applied Mathematics, 1998
Biclique-colouring powers of paths and powers of cycles
On List k-Coloring Convex Bipartite Graphs
AIRO Springer Series, 2020
New results on generalized graph coloring
2004
On the P3-Coloring of Bipartite Graphs
Mathematics
On the complexity of the selective graph coloring problem in some special classes of graphs
Theoretical Computer Science, 2013
Graph Coloring on Bipartite Graphs
International Journal of Mathematical, Engineering, Biological and Applied Computing
List Coloring of Block Graphs and Complete Bipartite Graphs
World Science
Selective graph coloring in some special classes of graphs
On the computational complexity of the bipartizing matching problem
Annals of Operations Research, 2021
Complexity of Coloring Graphs without Paths and Cycles
Lecture Notes in Computer Science, 2014
Mixing 3-colourings in bipartite graphs
European Journal of Combinatorics, 2009
Biclique Graphs of K3-free Graphs and Bipartite Graphs
Procedia Computer Science, 2021
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs
2018
NP-completeness results for some problems on subclasses of bipartite and chordal graphs
Theoretical Computer Science, 2007
On compact -edge-colorings: A polynomial time reduction from linear to cyclic
Discrete Optimization, 2011
On the simultaneous edge coloring of graphs
P_4-Colorings and P_4-Bipartite Graphs
Discrete Mathematics & Theoretical Computer Science
Maximization coloring problems on graphs with few
Discrete Applied Mathematics, 2014
Bounded Max-Colorings of Graphs
arXiv (Cornell University), 2009
On partial Grundy coloring of bipartite graphs and chordal graphs
Discrete Applied Mathematics, 2019
A Ramsey-type problem in directed and bipartite graphs
Periodica Mathematica Hungarica, 1973
A Code for m-Bipartite Edge-Coloured Graphs
2001
From Edge-Coloring to Strong Edge-Coloring
The Electronic Journal of Combinatorics, 2015
On the complexity of the black-and-white coloring problem on some classes of perfect graphs
Theoretical Computer Science, 2014
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
2009
Distance-2 edge coloring is np-complete
2005