Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs

Joseph Cheriyan, S. N. Maheshwari. Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs. J. Algorithms, 9(4):507-537, 1988.

@article{CheriyanM88:0,
  title = {Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs},
  author = {Joseph Cheriyan and S. N. Maheshwari},
  year = {1988},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/CheriyanM88%3A0},
  cites = {0},
  citedby = {0},
  journal = {J. Algorithms},
  volume = {9},
  number = {4},
  pages = {507-537},
}