Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 1,430 matches
- 2023
- Arman Aashtab, Saieed Akbari, Maryam Ghanbari, Amitis Shidani:
Vertex partitioning of graphs into odd induced subgraphs. Discuss. Math. Graph Theory 43(2): 385-399 (2023) - Fred M. Abdelmalek, Esther Vander Meulen, Kevin N. Vander Meulen, Adam Van Tuyl:
Well-covered token graphs. Discuss. Math. Graph Theory 43(3): 767-792 (2023) - Flor Aguilar-Campos, Gabriela Araujo-Pardo, Natalia García-Colín:
Scaffold for the polyhedral embedding of cubic graphs. Discuss. Math. Graph Theory 43(2): 351-384 (2023) - Liliana Alcón, Marisa Gutierrez, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo:
The neighbor-locating-chromatic number of trees and unicyclic graphs. Discuss. Math. Graph Theory 43(3): 659-675 (2023) - Liliana Alcón, María Pía Mazzoleni, Tanilson D. Santos:
Relationship among B1-EPG, VPT and EPT graphs classes. Discuss. Math. Graph Theory 43(3): 841-858 (2023) - Stephan Dominique Andres:
Strong and weak Perfect Digraph Theorems for perfect, α-perfect and strictly perfect digraphs. Discuss. Math. Graph Theory 43(4): 909-930 (2023) - Gabriela Araujo-Pardo, Fidel Barrera-Cruz, Natalia García-Colín:
Biregular (and regular) planar cages. Discuss. Math. Graph Theory 43(4): 1171-1194 (2023) - Zbigniew R. Bogdanowicz:
On q-connected chordal graphs with minimum number of spanning trees. Discuss. Math. Graph Theory 43(4): 1019-1032 (2023) - Peter Borg, Carl Feghali:
The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem. Discuss. Math. Graph Theory 43(1): 277-286 (2023) - Sopon Boriboon, Teeradej Kittipassorn:
The graph grabbing game on blow-ups of trees and cycles. Discuss. Math. Graph Theory 43(4): 895-907 (2023) - Claudson F. Bornstein, Gila Morgenstern, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Helly and strong Helly numbers of Bk-EPG and Bk-VPG graphs. Discuss. Math. Graph Theory 43(4): 1237-1252 (2023) - Amanda Burcroff:
Domination parameters of the unitary Cayley graph of ℤ/nℤ. Discuss. Math. Graph Theory 43(1): 95-114 (2023) - Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Equimatchable bipartite graphs. Discuss. Math. Graph Theory 43(1): 77-94 (2023) - MacKenzie Carr, Christina M. Mynhardt, Ortrud R. Oellermann:
Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs. Discuss. Math. Graph Theory 43(3): 859-874 (2023) - Guowei Dai:
The existence of path-factor covered graphs. Discuss. Math. Graph Theory 43(1): 5-16 (2023) - Peter Dankelmann, Matthew DeVilbiss, David J. Erwin, Kelly Guest, Ryan Matzke:
On subgraphs with prescribed eccentricities. Discuss. Math. Graph Theory 43(3): 685-702 (2023) - Peter Dankelmann, Jane Morgan, Emily Rivett-Carnac:
Metric dimension and diameter in bipartite graphs. Discuss. Math. Graph Theory 43(2): 487-498 (2023) - Simone Dantas, Rodrigo Marinho, Myriam Preissmann, Diana Sasaki:
New results on Type 2 snarks. Discuss. Math. Graph Theory 43(4): 879-893 (2023) - Randy Davila, Michael A. Henning, Ryan Pepper:
Zero and total forcing dense graphs. Discuss. Math. Graph Theory 43(3): 619-634 (2023) - Louis DeBiasio, Robert A. Krueger:
A note about monochromatic components in graphs of large minimum degree. Discuss. Math. Graph Theory 43(3): 607-618 (2023) - Tanja Dravec, Andrej Taranenko:
Daisy Hamming graphs. Discuss. Math. Graph Theory 43(2): 421-436 (2023) - Stefan Ehard, Elena Mohr, Dieter Rautenbach:
Biholes in balanced bipartite graphs. Discuss. Math. Graph Theory 43(4): 1203-1213 (2023) - Soogang Eoh, Myungho Choi, Suh-Ryung Kim:
The niche graphs of multipartite tournaments. Discuss. Math. Graph Theory 43(4): 1123-1146 (2023) - Beka Ergemlidze, Abhishek Methuku, Michael Tait, Craig Timmons:
Minimizing the number of complete bipartite graphs in a Ks-saturated graph. Discuss. Math. Graph Theory 43(3): 793-807 (2023) - Yanhong Gao, Ping Li, Xueliang Li:
Extremal graphs and classification of planar graphs by MC-numbers. Discuss. Math. Graph Theory 43(4): 1253-1272 (2023) - Dániel Gerbner:
Generalized Turán problems for small graphs. Discuss. Math. Graph Theory 43(2): 549-572 (2023) - Jean-Christophe Godin, Olivier Togni:
Choosability with separation of cycles and outerplanar graphs. Discuss. Math. Graph Theory 43(3): 743-760 (2023) - Aleksandra Gorzkowska, Michael A. Henning, Monika Pilsniak, Elzbieta Tumidajewicz:
Total and paired domination stability in prisms. Discuss. Math. Graph Theory 43(4): 1147-1169 (2023) - Anni Hakanen, Ville Junnila, Tero Laihonen, María Luz Puertas:
On the metric dimensions for sets of vertices. Discuss. Math. Graph Theory 43(1): 245-275 (2023) - Dang Hanh:
Spanning trees with a bounded number of branch vertices in a K1, 4-free graph. Discuss. Math. Graph Theory 43(4): 1195-1202 (2023)
skipping 1,400 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-06-21 17:41 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint