Остановите войну!
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 64 matches
- 2012
- R. Julian R. Abel, Frank E. Bennett:
Super-Simple Twofold Steiner Pentagon Systems. Graphs Comb. 28(3): 297-308 (2012) - Bijo S. Anand, Manoj Changat, Sandi Klavzar, Iztok Peterin:
Convex Sets in Lexicographic Products of Graphs. Graphs Comb. 28(1): 77-84 (2012) - Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel:
Degree Sequences and the Existence of k-Factors. Graphs Comb. 28(2): 149-166 (2012) - Haitze J. Broersma, Zdenek Ryjácek, Petr Vrána:
How Many Conjectures Can You Stand? A Survey. Graphs Comb. 28(1): 57-75 (2012) - Véronique Bruyère, Gwenaël Joret, Hadrien Mélot:
Trees with Given Stability Number and Minimum Number of Stable Sets. Graphs Comb. 28(2): 167-187 (2012) - Bart De Bruyn:
Intriguing Sets of Points of Q(2n, 2) \Q +(2n - 1, 2). Graphs Comb. 28(6): 791-805 (2012) - Grant Cairns, Yury Nikolayevsky:
Outerplanar Thrackles. Graphs Comb. 28(1): 85-96 (2012) - Ni Cao, Han Ren:
Exponentially Many Monochromatic n-Matchings in K 3n-1. Graphs Comb. 28(3): 309-314 (2012) - Mustapha Chellali, Frédéric Maffray:
Dominator Colorings in Some Classes of Graphs. Graphs Comb. 28(1): 97-107 (2012) - Yichao Chen, Toufik Mansour, Qian Zou:
Embedding Distributions and Chebyshev Polynomials. Graphs Comb. 28(5): 597-614 (2012) - Beifang Chen, Richard P. Stanley:
Orientations, Lattice Polytopes, and Group Arrangements II: Modular and Integral Flow Polynomials of Graphs. Graphs Comb. 28(6): 751-779 (2012) - Sebastian M. Cioaba, André Kündgen:
Covering Complete Hypergraphs with Cuts of Minimum Total Size. Graphs Comb. 28(1): 109-122 (2012) - Joshua N. Cooper, John Lenz, Timothy D. LeSaulnier, Paul S. Wenger, Douglas B. West:
Uniquely C 4-Saturated Graphs. Graphs Comb. 28(2): 189-197 (2012) - Ashraf Daneshkhah, Alice Devillers:
A Classification of Graphs Whose Subdivision Graph is Locally Distance Transitive. Graphs Comb. 28(6): 781-789 (2012) - Ermelinda DeLaViña, Craig E. Larson, Ryan Pepper, Bill Waller:
A Characterization of Graphs Where the Independence Number Equals the Radius. Graphs Comb. 28(3): 315-332 (2012) - Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On the Convexity Number of Graphs. Graphs Comb. 28(3): 333-345 (2012) - Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
Finding a Sun in Building-Free Graphs. Graphs Comb. 28(3): 347-364 (2012) - Shonda Gosselin:
Self-Complementary Non-Uniform Hypergraphs. Graphs Comb. 28(5): 615-635 (2012) - Litao Guo, Ruifang Liu, Xiaofeng Guo:
Super Connectivity and Super Edge Connectivity of the Mycielskian of a Graph. Graphs Comb. 28(2): 143-147 (2012) - Stephen G. Hartke, Geir T. Helleloid:
Reconstructing a Graph from its Arc Incidence Graph. Graphs Comb. 28(5): 637-652 (2012) - Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé:
Packing and Covering Triangles in K 4-free Planar Graphs. Graphs Comb. 28(5): 653-662 (2012) - Changxiang He, Yusheng Li, Lin Dong:
Three-Color Ramsey Numbers of K n Dropping an Edge. Graphs Comb. 28(5): 663-669 (2012) - Michael A. Henning, Anders Yeo:
Girth and Total Domination in Graphs. Graphs Comb. 28(2): 199-214 (2012) - Andreas M. Hinz, Daniele Parisse:
The Average Eccentricity of Sierpiński Graphs. Graphs Comb. 28(5): 671-686 (2012) - Akira Hiraki:
A Characterization of the Hamming Graphs and the Dual Polar Graphs by Completely Regular Subgraphs. Graphs Comb. 28(4): 449-467 (2012) - Mirko Hornák, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak:
Dense Arbitrarily Vertex Decomposable Graphs. Graphs Comb. 28(6): 807-821 (2012) - Boris Horvat, Tomaz Pisanski, Arjana Zitnik:
Isomorphism Checking of I-graphs. Graphs Comb. 28(6): 823-830 (2012) - Jianfeng Hou, Guizhen Liu, Jianliang Wu:
Acyclic Edge Coloring of Planar Graphs Without Small Cycles. Graphs Comb. 28(2): 215-226 (2012) - Yufei Huang, Bolian Liu, Siyuan Chen:
The Generalized τ-Bases of Primitive Non-Powerful Signed Digraphs with d Loops. Graphs Comb. 28(2): 227-242 (2012) - Ville Junnila, Tero Laihonen:
Optimal Identifying Codes in Cycles and Paths. Graphs Comb. 28(4): 469-481 (2012)
skipping 34 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-26 12:24 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