Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs

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

Abstract

We investigate graphs that can be represented as vertex intersections of horizontal and vertical paths in a grid, the so called \(B_0\)-VPG graphs. Recognizing this class is an NP-complete problem. Although, there exists a polynomial time algorithm for recognizing chordal \(B_0\)-VPG graphs. In this paper, we present a minimal forbidden induced subgraph characterization of \(B_0\)-VPG graphs restricted to block graphs. As a byproduct, the proof of the main theorem provides an alternative certifying recognition and representation algorithm for \(B_0\)-VPG graphs in the class of block graphs.

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

Access this article

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Asinowski, A., Cohen, E., Golumbic, M.C., Limouzy, V., Lipshteyn, M., Stern, M.: Vertex intersection graphs of paths on a grid. J. Graph Algorithms Appl. 16(2), 129–150 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2007)

    MATH  Google Scholar 

  3. Brady, M.L., Sarrafzadeh, M.: Stretching a knock-knee layout of multilayer wiring. IEEE Trans. Comput. 39, 148–151 (1990)

    Article  Google Scholar 

  4. Chaplick, S., Cohen, E., Stacho, J.: Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid. Lect. Notes Comput. Sci. 6986, 319–330 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Golumbic, M.C., Ries, B.: On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs. Graphs Comb. 29, 499–517 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  6. Harary, F., Prins, G.: The block-cutpoint-tree of a graph. Publ. Math. Debr. 13, 103–107 (1966)

    MathSciNet  MATH  Google Scholar 

  7. Kratochvíl, J., Matoušek, J.: Intersection graphs of segments. J. Comb. Theory Ser. B 62, 289–315 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  8. Molitor, P.: A survey on wiring. EIK J. Inf. Process. Cybern. 27, 3–19 (1991)

    MATH  Google Scholar 

  9. Sinden, F.W.: Topology of thin film RC circuits. Bell Syst. Tech. J. 45, 1639–1662 (1966)

    Article  MATH  Google Scholar 

Download references

Acknowledgements

We want to thank the anonymous referee for his/her suggestions to improve the writing of this manuscript.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Flavia Bonomo.

Additional information

This work was partially supported by UBACyT Grant 20020130100808BA, CONICET PIP 122-01001-00310 and 112-201201-00450CO and ANPCyT PICT 2012-1324 and 2015-2218 (Argentina).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Alcón, L., Bonomo, F. & Mazzoleni, M.P. Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs. Graphs and Combinatorics 33, 653–664 (2017). https://doi.org/10.1007/s00373-017-1791-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-017-1791-6

Keywords