Advanced search
Publication Cover
AKCE International Journal of Graphs and Combinatorics Volume 7, 2010 - Issue 1
Submit an article Journal homepage
369
Views
0
CrossRef citations to date
0
Altmetric
Articles

On Determination and Construction of Critically 2-Connected Graphs

Y.M. BorseDepartment of Mathematics University of Pune, PuneINDIA. e-mail: [email protected], [email protected]
,
B.N. WaphareDepartment of Mathematics University of Pune, PuneINDIA. e-mail: [email protected], [email protected]
&
M. Kriesell
(Communicated by)
Pages 73-83 | Received 04 Jun 2008, Accepted 05 May 2010, Published online: 10 Mar 2020

References

  • Y.M. Borse, On removable cycles and chains in connected graphs and related aspects in matroids, Ph.D. Thesis submitted to University of Pune, 2007.
  • G. Chartrand, A. Kaugars and D.R. Lick, Critically n-connected graphs, Proc. Amer. Math. Soc., 32 (1972), 63–68.
  • G.A. Dirac, Minimally 2-connected graphs, J. Reine Angew. Math., 228 (1967), 204–216.
  • D. Eppstein, Parallel recognition of series-parallel graphs, Information and Computation, 98 (1992), 41–55.
  • A. Jacoby, M. Liśkiewicz and R. Reischuk, Space efficient algorithms for series-parallel graphs, STACS (2001) (Dresden) 339–352; Lecture notes in computer science, 2010, Springer, Berlin, 2001.
  • M. Juvan, B. Mohar and R. Thomas, List edge-coloring of series-parallel graphs, Electron. J. Combin., 6 (1999), Research Paper 42, 6 pp.
  • M. Kriesell, Contractible subgraphs in 3-connected graphs, J. Combin. Theory Ser. B, 80 (2000), 32–48.
  • M. Kriesell, Almost all 3-connected graphs contain a contractible set of k vertices, J. Combin. Theory Ser. B, 83 (2001), 305–319.
  • D. Marx, NP-completeness of list coloring and precoloring extension of the edges of planar graphs, J. Graph Theory, 49 (2005), 313–324.
  • W. McCuaig and K. Ota, Contractible triples in 3-connected graphs, J. Combin. Theory Ser. B, 60 (1994), 308–314.
  • L. Nebeský, On induced subgraphs of a block, J. Graph Theory, 1 (1977), 69–74.
  • M.D. Plummer, On minimal blocks, Trans. Amer. Math. Soc., 134 (1968), 85–94.
  • P.D. Seymour, Coloring parallel graphs, Combinatorica, 10 (1990), 379–392.
  • M.M. Systo, Series-parallel graphs and depth-first search trees, IEEE Trans. Circuits and Systems, 31 (1984), 1029–1033.
  • N.K. Thakare, M.M. Pawar and B.N. Waphare, A structure theorem for dsimantlable lattices and enumeration, Period. Math. Hunger., 45 (2002), 147–160.
  • R. Thomas, Series-parallel graphs, htpp://www.math.gatech.edu/thomas/TEACH/8863/.
  • D.B. West, Introduction to Graph Theory, Second ed., Prentice Hall of India, New Delhi, (2002).
  • H. Whitney, Non-separable and planar graphs, Trans. Amer. Math. Soc., 34 (1932), 339–362.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.