Skip to main content
Springer Nature Link
Log in

On the Chromaticity of Multi-Bridge Hypergraphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A multi-bridge hypergraph is an h-uniform linear hypergraph consisting of some linear paths having common extremities. In this paper it is proved that the multisets of path lengths of two chromatically equivalent multi-bridge hypergraphs are equal provided the multiplicities of path lengths are bounded above by 2h-1 − 2. Also, it is shown that h-uniform linear cycles of length m are not chromatically unique for every m, h ≥ 3.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Berge, C.: Hypergraphes, Bordas, Paris, 1987

  2. Bhatti, A.A.: On h-chromatic uniqueness of two linear uniform cycles having some edges in common, Ars Combinatoria, 85, 331–339 (2007)

    Google Scholar 

  3. Bhatti, A.A.: Chromatic polynomials and chromaticity in graphs and hypergraphs (PhD thesis), GC University, Lahore, Pakistan, 2007

  4. Chao, C.Y., Whitehead, E.G. Jr.: On chromatic equivalence of graphs, in “Theory and Applications of Graphs” (Y. Alavi and D. R. Lick, Eds.), Lecture Notes in Math., Vol. 642, 121-131, Springer-Verlag, New York/Berlin, 1978

  5. Dohmen, K.: Chromatische Polynome von Graphen und Hypergraphen, Dissertation, Düsseldorf, 1993

  6. Dong, F.M., Koh, K.M., Teo, K.L.: Chromatic polynomials and chromaticity of graphs, World Scientific, Singapore, 2005

  7. Tomescu, I.: Chromatic coefficients of linear uniform hypergraphs, J. Combin. Theory, B 72, 229–235 (1998)

    Google Scholar 

  8. Tomescu, I.: On the chromaticity of sunflower hypergraphs SH(n,p,h), Discrete Math., 307, 6, 781–786 (2007)

Download references

Author information

Authors and Affiliations

  1. Abdus Salam School of Mathematical Sciences, Government College University, 35-C-II, Gulberg III, Lahore, Pakistan

    S. A. Bokhary

  2. Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei, 14, 010014, Bucharest, Romania

    Ioan Tomescu

  3. National University of Computer and Emerging Sciences, 852-B Block, Lahore, Pakistan

    Akhlaq Ahmad Bhatti

Authors
  1. S. A. Bokhary
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Ioan Tomescu
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Akhlaq Ahmad Bhatti
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to S. A. Bokhary.

Additional information

S. A. Bokhary: This research is partially supported by Abdus Salam School of Mathematical Sciences, Lahore and Higher Education Commission of Pakistan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bokhary, S.A., Tomescu, I. & Bhatti, A.A. On the Chromaticity of Multi-Bridge Hypergraphs. Graphs and Combinatorics 25, 145–152 (2009). https://doi.org/10.1007/s00373-008-0831-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-008-0831-7

Keywords

Mathematics Subject Classification