Остановите войну!
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 121 matches
- 2017
- Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Ortrud R. Oellermann, Johan P. de Wet:
On Saito's Conjecture and the Oberly-Sumner Conjectures. Graphs Comb. 33(4): 583-594 (2017) - Paniz Abedin, Saieed Akbari, Marc Demange, Tínaz Ekim:
Complexity of the Improper Twin Edge Coloring of Graphs. Graphs Comb. 33(4): 595-615 (2017) - Janusz Adamus:
A Degree Sum Condition for Hamiltonicity in Balanced Bipartite Digraphs. Graphs Comb. 33(1): 43-51 (2017) - Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero:
Proper Hamiltonian Paths in Edge-Coloured Multigraphs. Graphs Comb. 33(4): 617-633 (2017) - Yasmeen Akhtar, Soumen Maity:
Covering Arrays on Product Graphs. Graphs Comb. 33(4): 635-652 (2017) - Liliana Alcón, Flavia Bonomo, María Pía Mazzoleni:
Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs. Graphs Comb. 33(4): 653-664 (2017) - Saeid Alikhani, Davood Fatehi, Sandi Klavzar:
On the Structure of Dominating Graphs. Graphs Comb. 33(4): 665-672 (2017) - Hanieh Amjadi, Nasrin Soltankhah:
The 3-Way Intersection Problem for Kirkman Triple Systems. Graphs Comb. 33(4): 673-687 (2017) - Kiyoshi Ando:
Small Components of the 5-Subgraph of a Contraction-critically 5-Connected Graph. Graphs Comb. 33(6): 1485-1497 (2017) - Eric Andrews, Gary Chartrand, Chira Lumduanhom, Ping Zhang:
Stars and Their k-Ramsey Numbers. Graphs Comb. 33(2): 257-274 (2017) - Gabriela Araujo-Pardo, César Hernández-Cruz, Juan José Montellano-Ballesteros:
The Strong Convexity Spectra of Grids. Graphs Comb. 33(4): 689-713 (2017) - Subramanian Arumugam, K. Premalatha, Martin Baca, Andrea Semanicová-Fenovcíková:
Local Antimagic Vertex Coloring of a Graph. Graphs Comb. 33(2): 275-285 (2017) - John Asplund, Joe Chaffee, James M. Hammer:
Decomposition of a Complete Bipartite Multigraph into Arbitrary Cycle Sizes. Graphs Comb. 33(4): 715-728 (2017) - Eiichi Bannai, Etsuko Bannai, Hajime Tanaka, Yan Zhu:
Design Theory from the Viewpoint of Algebraic Combinatorics. Graphs Comb. 33(1): 1-41 (2017) - Christian Barrientos, Elliot Krop:
Improved Bounds for Relaxed Graceful Trees. Graphs Comb. 33(2): 287-305 (2017) - Tsyndyma Chimit-Dordjievna Batueva, Oleg V. Borodin, Anna O. Ivanova:
All Tight Descriptions of 4-Paths in 3-Polytopes with Minimum Degree 5. Graphs Comb. 33(1): 53-62 (2017) - Douglas Bauer, Aori Nevo, Edward F. Schmeichel:
Best Monotone Degree Condition for the Hamiltonicity of Graphs with a 2-Factor. Graphs Comb. 33(5): 1231-1248 (2017) - Oliver Bendele, Dieter Rautenbach:
Optimal Colorings with Rainbow Paths. Graphs Comb. 33(4): 729-734 (2017) - Patrick Bennett, Andrzej Dudek, Elliot Laforge:
On the Number of Alternating Paths in Bipartite Complete Graphs. Graphs Comb. 33(2): 307-320 (2017) - Julien Bensmail, Christopher Duffy, Sagnik Sen:
Analogues of Cliques for (m, n)-Colored Mixed Graphs. Graphs Comb. 33(4): 735-750 (2017) - Zhanar Berikkyzy, Christopher Cox, Michael Dairyko, Kirsten Hogenson, Mohit Kumbhat, Bernard Lidický, Kacy Messerschmidt, Kevin Moss, Kathleen Nowak, Kevin F. Palmowski, Derrick Stolee:
(4, 2)-Choosability of Planar Graphs with Forbidden Structures. Graphs Comb. 33(4): 751-787 (2017) - Stéphane Bessy, Dieter Rautenbach:
Extremal Values of the Chromatic Number for a Given Degree Sequence. Graphs Comb. 33(4): 789-799 (2017) - Anthony Bonato, Xavier Pérez-Giménez, Pawel Pralat, Benjamin Reiniger:
The Game of Overprescribed Cops and Robbers Played on Graphs. Graphs Comb. 33(4): 801-815 (2017) - Oleg V. Borodin, Anna O. Ivanova, Ekaterina I. Vasil'eva:
A Steinberg-Like Approach to Describing Faces in 3-Polytopes. Graphs Comb. 33(1): 63-71 (2017) - Glencora Borradaile, Hung Le, Melissa Sherman-Bennett:
Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph. Graphs Comb. 33(6): 1621-1634 (2017) - Prosenjit Bose, Vida Dujmovic, Pat Morin, Lucas Rioux-Maldague:
New Bounds for Facial Nonrepetitive Colouring. Graphs Comb. 33(4): 817-832 (2017) - Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
Minimum Degree Conditions for the Proper Connection Number of Graphs. Graphs Comb. 33(4): 833-843 (2017) - Bart De Bruyn:
On the adjacency algebras of near hexagons with an order. Graphs Comb. 33(5): 1219-1230 (2017) - Christie S. Burris, Francis C. Motta, Patrick D. Shipman:
An Unoriented Variation on de Bruijn Sequences. Graphs Comb. 33(4): 845-858 (2017) - Domingos M. Cardoso, David Pokrass Jacobs, Vilmar Trevisan:
Laplacian Distribution and Domination. Graphs Comb. 33(5): 1283-1295 (2017)
skipping 91 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-04-23 08:17 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