@InProceedings{misra_et_al:LIPIcs.MFCS.2023.68,
  author =	{Misra, Neeldhara and Nanoti, Saraswati Girish},
  title =	{{Spartan Bipartite Graphs Are Essentially Elementary}},
  booktitle =	{48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)},
  pages =	{68:1--68:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-292-1},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{272},
  editor =	{Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.68},
  URN =		{urn:nbn:de:0030-drops-186025},
  doi =		{10.4230/LIPIcs.MFCS.2023.68},
  annote =	{Keywords: Bipartite Graphs, Eternal Vertex Cover, Perfect Matchings, Elementary, Spartan}
}