Skip to main content
SpringerLink
Log in

The Intersection of Two Vertex Coloring Problems

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A hole is a chordless cycle with at least four vertices. A hole is even if its number of vertices is even. Given a set L of graphs, a graph G is L-free if G does not contain any graph in L as an induced subgraph. Currently, the following two problems are unresolved: the complexity of coloring even hole-free graphs, and the complexity of coloring \((4K_1, C_4)\)-free graphs. The intersection of these two problems is the problem of coloring \((4K_1, C_4, C_6)\)-free graphs. In this paper we present partial results on this problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Notes

  1. We note that the definition of near-uniform partition in [10] is incomplete. The sets \(S_i\)’s must be cliques for the theorem to hold.

References

  1. Addario-Berry, L., Chudnovsky, M., Havet, F., Reed, B., Seymour, P.: Bisimplicial vertices in even-hole-free graphs. J. Combin. Theory Ser. B 98, 1119–1164 (2008)

    Article  MathSciNet  Google Scholar 

  2. Beineke, L.W.: Characterizations of derived graphs. J. Combin. Theory 9, 129–135 (1970)

    Article  MathSciNet  Google Scholar 

  3. Berge, C.: Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 10, 114 (1961)

  4. Berge, C., Chvátal, V. (eds.): Topics on Perfect Graphs. North-Holland, Amsterdam (1984)

    MATH  Google Scholar 

  5. Brandstädt, A., Dragan, F.F., Le, H.O., Mosca, R.: New graph classes of bounded clique-width. Theory Comput. Syst. 38, 623–645 (2005)

    Article  MathSciNet  Google Scholar 

  6. Brandstädt, A., Engelfriet, J., Le, H.O., Lozin, V.V.: Clique-width for 4-vertex forbidden subgraphs. Theory Comput. Syst. 39, 561–590 (2006)

    Article  MathSciNet  Google Scholar 

  7. Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51–229 (2006)

    Article  MathSciNet  Google Scholar 

  8. Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101, 77–114 (2000)

    Article  MathSciNet  Google Scholar 

  9. Dirac, G.A.: On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 25(1–2), 71 (1961)

    Article  MathSciNet  Google Scholar 

  10. Fraser, D.J., Hamel, A.M., Hoàng, C.T., Holmes, K., LaMantia, T.P.: Characterizations of (\(4K_1, C_4, C_5\))-free graphs. Discrete Appl. Math. 231, 166–174 (2017)

    Article  MathSciNet  Google Scholar 

  11. Gaspers, S., Huang, S., Paulusma, D.: Colouring square-free graphs without long induced paths. arXiv:1805.08270

  12. Golovach, P., Johnson, M., Paulusma, D., Song, J.: A survey on the computational complexity of coloring graphs with forbidden subgraphs. J. Graph Theory 84, 331–363 (2017)

    Article  MathSciNet  Google Scholar 

  13. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)

    MATH  Google Scholar 

  14. Grötschel, M., Lovász, L., Schrijver, A.: Polynomial algorithms for perfect graphs. In: Berge, C., Chvátal, V. (eds.) Topics on Perfect Graphs. North-Holland, Amsterdam (1984)

    MATH  Google Scholar 

  15. Gurski, F.: Graph operations on clique-width bounded graphs. arXiv:cs/0701185 (2007)

  16. Lovász, L.: Normal hypergraphs and the perfect graph conjecture. Discrete Math. 2, 253–267 (1972)

    Article  MathSciNet  Google Scholar 

  17. Lozin, V.V., Malyshev, D.S.: Vertex colouring of graphs with few obstructions. Discrete Appl. Math. 216, 273–284 (2017). https://doi.org/10.1016/j.dam.2015.02.015

    Article  MathSciNet  MATH  Google Scholar 

  18. Lozin, V.V., Rautenbach, D.: On the band-, tree-, and clique-width of graphs with bounded vertex degree. SIAM J. Discrete Math. 18, 195–206 (2004)

    Article  MathSciNet  Google Scholar 

  19. Malyshev, D.: Polynomial-time approximation algorithms for the coloring problem in some cases. J. Combin. Optim. 33(3), 809–813 (2017)

    Article  MathSciNet  Google Scholar 

  20. Rao, M.: MSOL partitioning problems on graphs of bounded tree width and clique-width. Theor. Comput. Sci. 377, 260–267 (2007)

    Article  Google Scholar 

  21. Tarjan, R.E.: Decomposition by clique separators. Discrete Math. 55, 221–232 (1985)

    Article  MathSciNet  Google Scholar 

  22. Whitesides, S.H.: A method for solving certain graph recognition and optimization problems, with applications to perfect graphs. In: Berge, C., Chvátal, V. (eds.) Topics on Perfect Graphs. North-Holland, Amsterdam (1984)

    Google Scholar 

Download references

Acknowledgements

This work was supported by the Canadian Tri-Council Research Support Fund. The authors A.M.F. and C.T.H. were each supported by individual NSERC Discovery Grants. Author T.P.M was supported by an NSERC Undergraduate Student Research Award (USRA). This work was done by authors D.J.F. and K.H. in partial fulfillment of the course requirements for CP493: Directed Research Project I in the Department of Physics and Computer Science at Wilfrid Laurier University.

Author information

Authors and Affiliations

  1. Department of Physics and Computer Science, Wilfrid Laurier University, Waterloo, ON, Canada

    Angèle M. Foley, Dallas J. Fraser, Chính T. Hoàng, Kevin Holmes & Tom P. LaMantia

Authors
  1. Angèle M. Foley
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dallas J. Fraser
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chính T. Hoàng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kevin Holmes
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Tom P. LaMantia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chính T. Hoàng.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Angèle M. Foley: formerly Angèle M. Hamel.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Foley, A.M., Fraser, D.J., Hoàng, C.T. et al. The Intersection of Two Vertex Coloring Problems. Graphs and Combinatorics 36, 125–138 (2020). https://doi.org/10.1007/s00373-019-02123-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-019-02123-1

Keywords

Search

Navigation