BibTeX Export for Cyclability in Graph Classes

Copy to Clipboard Download

@InProceedings{crespelle_et_al:LIPIcs.ISAAC.2019.16,
  author =	{Crespelle, Christophe and Feghali, Carl and Golovach, Petr A.},
  title =	{{Cyclability in Graph Classes}},
  booktitle =	{30th International Symposium on Algorithms and Computation (ISAAC 2019)},
  pages =	{16:1--16:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-130-6},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{149},
  editor =	{Lu, Pinyan and Zhang, Guochuan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.16},
  URN =		{urn:nbn:de:0030-drops-115128},
  doi =		{10.4230/LIPIcs.ISAAC.2019.16},
  annote =	{Keywords: Cyclability, interval graphs, bipartite permutation graphs, cographs}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode