Academic Journal
Recognition Complexity of Subgraphs of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf {k}}$$\end{document}-Connected Planar Cubic Graphs
| Τίτλος: | Recognition Complexity of Subgraphs of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf {k}}$$\end{document}-Connected Planar Cubic Graphs |
|---|---|
| Συγγραφείς: | Goetze, MiriamAff1, IDs00453025013508_cor1, Jungeblut, Paul, Ueckerdt, Torsten |
| Πηγή: | Algorithmica. 88(1) |
| Βάση Δεδομένων: | Springer Nature Journals |
καταχωρήστε σχόλιο πρώτοι!