EUVIMEDEUVIMED entdecken
Crossref

New proofs of Konig's bipartite graph characterization theorem

Salman Fawzi Ghazal

Indonesian Journal of Combinatorics · 2017

DOI: 10.19184/ijc.2017.1.2.4 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Indonesian Journal of Combinatorics, 2017. Verfasst von Salman Fawzi Ghazal.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We introduce four new elementary short proofs of the famous K\"{o}nig's theorem which characterizes bipartite graphs by absence of odd cycles. Our proofs are more elementary than earlier proofs because they use neither distances nor walks nor spanning trees.

Zitieren

APA

Ghazal, S. F. (2017). New proofs of Konig's bipartite graph characterization theorem. Indonesian Journal of Combinatorics. https://doi.org/10.19184/ijc.2017.1.2.4

Vancouver

Ghazal SF. New proofs of Konig's bipartite graph characterization theorem. Indonesian Journal of Combinatorics. 2017. doi:10.19184/ijc.2017.1.2.4

BibTeX
@article{Ghazal2017,
  author = {Ghazal, Salman Fawzi},
  title = {New proofs of Konig's bipartite graph characterization theorem},
  journal = {Indonesian Journal of Combinatorics},
  year = {2017},
  doi = {10.19184/ijc.2017.1.2.4}
}
Kostenlos starten →