Skip to main content
SpringerLink
Log in

On the Structure of Graphs Without Claw, \(4K_1\) and co-R

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

Abstract

Given a family F of graphs, a graph G is F-free if it does not contain any graph in F as an induced subgraph. The problem of determining the complexity of vertex coloring (claw, \(4K_1\))-free graphs is a well known open problem. In this paper, we solve the coloring problem for a subclass of (claw, \(4K_1\))-free graphs. We design a polynomial-time algorithm to color (\(claw\), \(4K_1\), \(co\)-\(R\))-free graphs. This algorithm is derived from a structural theorem on (\(claw\), \(4K_1\), \(co\)-\(R\))-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

Fig. 1
Fig. 2

Similar content being viewed by others

Data availability

Not applicable.

Code availability

Not applicable.

Notes

  1. Find a maximum matching in the complement of G, say this matching has m edges, then we know that \(\chi (G) = |V(G) | - m\)

  2. Actually it can be proved that \(cwd(P_5) = 3\).

  3. If \(C_n\) has exactly two vertices, then the labelling will be obvious from the algorithm’s description

  4. For the labelled graph (G, L), the labels need not be integers

  5. The proof of Lemma 3.37 also follows from application of Theorem 2.7 on the sets \(X_1, \dots , X_5\)

References

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

    Article  MathSciNet  Google Scholar 

  2. 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) 88

  3. Berge, C., Chvátal, V. (eds.): Topics on perfect graphs. North-Holland, Amsterdam (1984)

  4. Boliac, R., Lozin, V.V.: On the clique-width of graphs in hereditary classes, Proceedings of ISAAC 2002, Lecture Notes in Computer Science 2518 (2002), pp. 44–54

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. Chvátal, V., Sbihi, N.: Recognizing claw-free perfect graphs. J. Combinatorial Theory Ser. B 44, 154–176 (1988)

    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. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique width. Theory Comput. Syst. 33, 125–150 (2000)

    Article  MathSciNet  Google Scholar 

  10. Dai, Y., Foley, A. M., Hoàng, C. T.: On Coloring a Class of Claw-free Graphs: To the memory of Frédéric Maffray, Electronic Notes in Theoretical Computer Science 346 (2019) 369–377

  11. Fraser, D.J., Hamel, A.M., Hoàng, C.T., Maffray, F.: A coloring algorithm for \(4K_1\)-free line graphs. Disc. Appl. Math. 234, 76–85 (2018)

    Article  Google Scholar 

  12. Grötschel, M., Lovász, L., Schrijver, A.: Polynomial algorithms for perfect graphs, in [3]

  13. Hsu, W.-L.: How to color claw-free perfect graphs. Ann. Discrete Math. 11, 189–197 (1981)

    MathSciNet  MATH  Google Scholar 

  14. Lozin, V.V., Malyshev, D.S.: Vertex colouring of graphs with few obstructions Disc. Appl. Math. 216, 273–280 (2017)

    MATH  Google Scholar 

  15. Parthasarathy, K.R., Ravindra, G.: The strong perfect graph conjecture is true for \(K_{1,3}\)-free graphs. J. Combinatorial Theory Ser. B 21, 212–223 (1976)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported by the Canadian Tri-Council Research Support Fund. The author C.T.H. was supported by an individual NSERC Discovery Grant. Author T.A. was supported by an NSERC Undergraduate Student Research Award (USRA).

Funding

This work is supported by the Canadian Tri-Council Research Support Fund.

Author information

Authors and Affiliations

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

    Tala Abuadas & Chính T. Hoàng

Authors
  1. Tala Abuadas
    View author publications

    You can also search for this author in PubMed Google Scholar

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

    You can also search for this author in PubMed Google Scholar

Contributions

Not applicable.

Corresponding author

Correspondence to Chính T. Hoàng.

Ethics declarations

Conflicts of interests

Not applicable.

Ethics approval

Not applicable.

Consent to participate

Not applicable.

Consent for publication

All authors consent for the paper to be published in Graphs and Combinatoris.

Additional information

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Abuadas, T., Hoàng, C.T. On the Structure of Graphs Without Claw, \(4K_1\) and co-R. Graphs and Combinatorics 38, 123 (2022). https://doi.org/10.1007/s00373-022-02517-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00373-022-02517-8

Keywords

Search

Navigation