Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Semi-strict Chordal Digraphs

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13595))

Included in the following conference series:

  • 866 Accesses

Abstract

Chordal graphs are important in algorithmic graph theory. Chordal digraphs are a digraph analogue of chordal graphs and have been a subject of active studies recently. In this paper we introduce the notion of semi-strict chordal digraphs which form a class strictly between chordal digraphs and chordal graphs. We characterize semi-strict chordal digraphs by forbidden subdigraphs within the cases of locally semicomplete digraphs and weakly quasi-transitive digraphs.

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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

Similar content being viewed by others

References

  1. Bang-Jensen, J., Huang, J.: Quasi-transitive digraphs. J. Graph Theory 20, 141–161 (1995)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  3. Hell, P., Hernández-Cruz, C.: Strict chordal and strict split digraphs. Discrete Appl. Math. 216, 609–617 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  4. Huang, J., Ye, Y.Y.: Chordality of locally semicomplete and weakly quasi-transitive digraphs. Discret. Math. 344, 112362 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  5. Meister, D., Telle, J.A.: Chordal digraphs. Theoret. Comput. Sci. 463, 73–83 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  6. Haskins, L., Rose, D.J.: Toward characterization of perfect elimination digraphs. SIAM J. Comput. 2, 217–224 (1973)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Victoria, Victoria, BC, V8W 3R4, Canada

    Jing Huang & Ying Ying Ye

Authors
  1. Jing Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ying Ying Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ying Ying Ye .

Editor information

Editors and Affiliations

  1. Shenzhen Institute of Advanced Technology, Shenzhen, China

    Yong Zhang

  2. Harbin Institute of Technology, Harbin, China

    Dongjing Miao

  3. Technical University of Berlin, Berlin, Germany

    Rolf Möhring

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Huang, J., Ye, Y.Y. (2022). Semi-strict Chordal Digraphs. In: Zhang, Y., Miao, D., Möhring, R. (eds) Computing and Combinatorics. COCOON 2022. Lecture Notes in Computer Science, vol 13595. Springer, Cham. https://doi.org/10.1007/978-3-031-22105-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-22105-7_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-22104-0

  • Online ISBN: 978-3-031-22105-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics