Skip to main content
SpringerLink
Log in

Chromatic Number of ISK4-Free Graphs

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

Abstract

A graph G is said to be ISK4-free if it does not contain any subdivision of \(K_4\) as an induced subgraph. In this paper, we propose new upper bounds for the chromatic number of ISK4-free graphs and \(\{\)ISK4, triangle\(\}\)-free graphs.

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

Similar content being viewed by others

References

  1. Bondy, J.A., Murty, U.S.R.: Graph theory, vol. 244. Springer, New York (2008)

    MATH  Google Scholar 

  2. Chalopin, J., Esperet, L., Li, Z., Ossona de Mendez, P.: Restricted frame graphs and a conjecture of scott. Electron. J. Comb. 23(1), P1–30 (2016)

    MathSciNet  MATH  Google Scholar 

  3. Chudnovsky, M., Liu, C.H., Schaudt, O., Spirkl, S., Trotignon, N., Vuskovic, K.: Triangle-free graphs that do not contain an induced subdivision of \(k_4\) are 3-colorable (2017). arXiv:1704.08104

  4. Gyárfás, A.: Problems from the world surrounding perfect graphs. Appl. Math. 19(3–4), 413–441 (1987)

    MathSciNet  MATH  Google Scholar 

  5. Kühn, D., Osthus, D.: Induced subdivisions in \({K}_{s, s}\)-free graphs of large average degree. Combinatorica 24(2), 287–304 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Lévêque, B., Maffray, F., Trotignon, N.: On graphs with no induced subdivision of \({K}_4\). J. Combin. Theory Ser. B 102(4), 924–947 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Pawlik, A., Kozik, J., Krawczyk, T., Lasoń, M., Micek, P., Trotter, W.T., Walczak, B.: Triangle-free intersection graphs of line segments with large chromatic number. J. Comb. Theory Ser. B 105, 6–10 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  8. Scott, A.D.: Induced trees in graphs of large chromatic number. J. Graph Theory 24(4), 297–311 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. Trotignon, N., Vušković, K.: On triangle-free graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph. J. Graph Theory 84(3), 233–248 (2017)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The author would like to thank Nicolas Trotignon for his help and useful discussion.

Author information

Authors and Affiliations

  1. LIP, ENS de Lyon, Lyon, France

    Ngoc Khang Le

Authors
  1. Ngoc Khang Le
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ngoc Khang Le.

Additional information

This work was performed within the framework of the LABEX MILYON (ANR-10-LABX-0070) of Université de Lyon, within the program “Investissements d’Avenir” (ANR-11- IDEX-0007) operated by the French National Research Agency (ANR). Partially supported by ANR project Stint under reference ANR-13-BS02-0007.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Le, N.K. Chromatic Number of ISK4-Free Graphs. Graphs and Combinatorics 33, 1635–1646 (2017). https://doi.org/10.1007/s00373-017-1860-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-017-1860-x

Keywords

Search

Navigation