Coloring Problems on Bipartite Graphs of Small Diameter

@article{Campos2021ColoringPO,
  title={Coloring Problems on Bipartite Graphs of Small Diameter},
  author={Victor A. Campos and Guilherme Gomes and Allen Ibiapina and Raul Lopes and Ignasi Sau and Ana Silva},
  journal={Electron. J. Comb.},
  year={2021},
  volume={28},
  pages={2}
}
We investigate a number of coloring problems restricted to bipartite graphs with bounded diameter. First, we investigate the $k$-List Coloring, $k$-Coloring, and $k$-Precoloring Extension problems on bipartite graphs with diameter at most $d$, proving $\textsf{NP}$-completeness in most cases, and leaving open only the List $3$-Coloring and $3$-Precoloring Extension problems when $d=3$. Some of these results are obtained $\textsc{through}$ a proof that the Surjective $C_6$-Homomorphism problem… 
2 Citations

Figures and Tables from this paper

Faster 3-coloring of small-diameter graphs

This paper presents an algorithm that solves 3-Coloring in n-vertex diameter-2 graphs in time 2^{𝒪(n 1/3} log² n)}.

Fully Dynamic (Δ +1)-Coloring in O(1) Update Time

An improved randomized algorithm for (Δ +1)-coloring that achieves O(1) amortized update time and it is shown that this bound holds not only in expectation but also with high probability.

References

SHOWING 1-10 OF 38 REFERENCES

Complexity of Ck-Coloring in Hereditary Classes of Graphs

It is proved that if some component of $F$ is not a subgraph of a subdividecd claw, then the following problems are NP-complete in $F-free graphs: a)extension version of $C_k$-{\sc Coloring} for every odd $k \geq 5$, b) list version of £C-k-{\ sc Coloring for every even $k\geq 6$.

Open Problems on Graph Coloring for Special Graph Classes

This work surveys known results on the computational complexity of Coloring for graph classes that are hereditary or for which some graph parameter is bounded and considers coloring variants, such as precoloring extensions and list colorings and gives some open problems in the area of on-line coloring.

List Coloring in the Absence of a Linear Forest

For any two fixed integers k and r, it is shown that Listk-Coloring can be solved in polynomial time for graphs with no induced rP1+P5, hereby extending the result of Hoàng, Kamiński, Lozin, Sawada and Shu for graphswith no induced P5.

Finding vertex-surjective graph homomorphisms

The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows a vertex-surjective homomorphism to some other given graph H called the host graph, and it is shown that the problem is even NP-complete on many other elementary graph classes.

Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs

It is proved that for every varepsilon, 3-coloring is NP-complete on triangle-free graphs of diameter 3 and radius 2 with n vertices and minimum degree δ = Θ(n e ).

Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs

A number of new complexity results are proved for these three decision problems when restricted to graphs that do not contain a cycle on s vertices or a path on t vertices as induced subgraphs.

On the complexity of H-coloring

Covering graphs with few complete bipartite subgraphs

The computational complexity of disconnected cut and 2K2-partition

List Homomorphisms and Circular Arc Graphs

It is shown that the list homomorphism problem is polynomial time solvable if the complement of H is a circular arc graph of clique covering number two, and is NP-complete otherwise.