Skip to main content
SpringerLink
Log in

Graph Functionality

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11789))

Included in the following conference series:

Abstract

In the present paper, we introduce the notion of graph functionality, which generalizes simultaneously several other graph parameters, such as degeneracy or clique-width, in the sense that bounded degeneracy or bounded clique-width imply bounded functionality. Moreover, we show that this generalization is proper by revealing classes of graphs of unbounded degeneracy and clique-width, where functionality is bounded by a constant. We also prove that bounded functionality implies bounded VC-dimension, i.e. graphs of bounded VC-dimension extend graphs of bounded functionality, and this extension also is proper.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 74.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Atminas, A., Collins, A., Lozin, V., Zamaraev, V.: Implicit representations and factorial properties of graphs. Discrete Math. 338, 164–179 (2015)

    Article  MathSciNet  Google Scholar 

  2. Alon, N., Brightwell, G., Kierstead, H., Kostochka, A., Winkler, P.: Dominating sets in \(k\)-majority tournaments. J. Comb. Theory Ser. B 96, 374–387 (2006)

    Article  MathSciNet  Google Scholar 

  3. Balogh, J., Bollobás, B., Weinreich, D.: The speed of hereditary properties of graphs. J. Comb. Theory Ser. B 79, 131–156 (2000)

    Article  MathSciNet  Google Scholar 

  4. Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory Ser. B 41, 182–208 (1986)

    Article  MathSciNet  Google Scholar 

  5. Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. Syst. Sci. 46, 218–270 (1993)

    Article  MathSciNet  Google Scholar 

  6. 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 

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

    Article  MathSciNet  Google Scholar 

  8. Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. Int. J. Found. Comput. Sci. 11(3), 423–443 (2000)

    Article  MathSciNet  Google Scholar 

  9. Gurski, F., Wanke, E.: Line graphs of bounded clique-width. Discrete Math. 307, 2734–2754 (2007)

    Article  MathSciNet  Google Scholar 

  10. Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. In: STOC 1988, pp. 334–343 (1988)

    Google Scholar 

  11. Lejeune, M., Lozin, V., Lozina, I., Ragab, A., Yacout, S.: Recent advances in the theory and practice of Logical Analysis of Data. Eur. J. Oper. Res. 275, 1–15 (2019)

    Article  MathSciNet  Google Scholar 

  12. Lozin, V.: Minimal classes of graphs of unbounded clique-width. Ann. Comb. 15, 707–722 (2011)

    Article  MathSciNet  Google Scholar 

  13. Lozin, V.: Graph parameters and Ramsey theory. Lect. Notes Comput. Sci. 10765, 185–194 (2018)

    Article  MathSciNet  Google Scholar 

  14. Spinrad, J.P.: Efficient Graph Representations. Fields Institute Monographs, 19, xiii+342 pp. American Mathematical Society, Providence (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Institute, University of Warwick, Coventry, UK

    Bogdan Alecu & Vadim Lozin

  2. Department of Mathematics, London School of Economics, London, UK

    Aistis Atminas

Authors
  1. Bogdan Alecu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aistis Atminas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vadim Lozin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vadim Lozin .

Editor information

Editors and Affiliations

  1. CNRS, LIRMM, Université de Montpellier, Montpellier, France

    Ignasi Sau

  2. CNRS, LIRMM, Université de Montpellier, Montpellier, France

    Dimitrios M. Thilikos

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Alecu, B., Atminas, A., Lozin, V. (2019). Graph Functionality. In: Sau, I., Thilikos, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2019. Lecture Notes in Computer Science(), vol 11789. Springer, Cham. https://doi.org/10.1007/978-3-030-30786-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-30786-8_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-30785-1

  • Online ISBN: 978-3-030-30786-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation