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 55 matches
- 2008
- Armen S. Asratian, Carl Johan Casselgren:
On Path Factors of (3, 4)-Biregular Bigraphs. Graphs Comb. 24(5): 405-411 (2008) - Ch. Sobhan Babu, Ajit A. Diwan:
Degree Condition for Subdivisions of Unicyclic Graphs. Graphs Comb. 24(6): 495-509 (2008) - József Balogh, Alexandr V. Kostochka:
On 2-Detour Subgraphs of the Hypercube. Graphs Comb. 24(4): 265-272 (2008) - R. B. Bapat, A. K. Lal, Sukanta Pati:
Laplacian Spectrum of Weakly Quasi-threshold Graphs. Graphs Comb. 24(4): 273-290 (2008) - Tomasz Bartnicki, Jaroslaw Grytczuk:
A Note on the Game Chromatic Index of Graphs. Graphs Comb. 24(2): 67-70 (2008) - Arie Bialostocki, Rasheed Sabar, Daniel Schaal:
On a Zero-Sum Generalization of a Variation of Schur's Equation. Graphs Comb. 24(6): 511-518 (2008) - Elizabeth J. Billington, Nicholas J. Cavenagh:
Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths. Graphs Comb. 24(3): 129-147 (2008) - Csilla Bujtás, Zsolt Tuza:
Uniform Mixed Hypergraphs: The Possible Numbers of Colors. Graphs Comb. 24(1): 1-12 (2008) - L. Sunil Chandran, Alexandr V. Kostochka, J. Krishnam Raju:
Hadwiger Number and the Cartesian Product of Graphs. Graphs Comb. 24(4): 291-301 (2008) - Yeow Meng Chee, Alan C. H. Ling, Hao Shen:
The Fine Intersection Problem for Steiner Triple Systems. Graphs Comb. 24(3): 149-157 (2008) - Beifang Chen, Guantao Chen:
Gauss-Bonnet Formula, Finiteness Condition, and Characterizations of Graphs Embedded in Surfaces. Graphs Comb. 24(3): 159-183 (2008) - Beifang Chen, Arthur L. B. Yang, Terence Y. J. Zhang:
A Bijection for Eulerian-equivalence Classes of Totally Cyclic Orientations. Graphs Comb. 24(6): 519-530 (2008) - Sheshayya A. Choudum, T. Karthick, M. A. Shalu:
Linear Chromatic Bounds for a Subfamily of 3 K 1-free Graphs. Graphs Comb. 24(5): 413-428 (2008) - Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Addendum to "Bicolored Matchings in Some Classes of Graphs". Graphs Comb. 24(2): 127-128 (2008) - Jiuying Dong:
A 2-factor with Short Cycles Passing Through Specified Independent Vertices in Graph. Graphs Comb. 24(2): 71-80 (2008) - Paul Dorbec, Sylvain Gravier:
Paired-Domination in P 5-Free Graphs. Graphs Comb. 24(4): 303-308 (2008) - Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto:
On a Spanning Tree with Specified Leaves. Graphs Comb. 24(1): 13-18 (2008) - Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Disproof of a Conjecture on the Subdivision Domination Number of a Graph. Graphs Comb. 24(4): 309-312 (2008) - Mohammad Ghebleh, Luis A. Goddyn, Ebadollah S. Mahmoodian, Maryam Verdian-Rizi:
Silver Cubes. Graphs Comb. 24(5): 429-442 (2008) - Mario Gionfriddo, Peter Horák, Lorenzo Milazzo, Alexander Rosa:
Equitable Specialized Block-Colourings for Steiner Triple Systems. Graphs Comb. 24(4): 313-326 (2008) - Izolda Gorgol:
Rainbow Numbers for Cycles with Pendant Edges. Graphs Comb. 24(4): 327-331 (2008) - Jiangyan Guo, Elkin Vumar:
On the Circumference of 2-Connected P3\mathcal{P}_{3}-Dominated Graphs. Graphs Comb. 24(5): 443-451 (2008) - András Gyárfás, Gábor N. Sárközy:
Size of Monochromatic Double Stars in Edge Colorings. Graphs Comb. 24(6): 531-536 (2008) - Mariko Hagita, Makoto Matsumoto, Fumio Natsu, Yuki Ohtsuka:
Error Correcting Sequence and Projective De Bruijn Graph. Graphs Comb. 24(3): 185-194 (2008) - Michael A. Henning, Anders Yeo:
Total Domination in Graphs with Given Girth. Graphs Comb. 24(4): 333-348 (2008) - Akira Hiraki:
Strongly Closed Subgraphs in a Distance-Regular Graph with c 2 > 1. Graphs Comb. 24(6): 537-550 (2008) - Mitsugu Hirasaka, Hanguk Kang, Kijung Kim:
Equitable Partitions of Flat Association Schemes. Graphs Comb. 24(2): 81-89 (2008) - Mirko Hornák, Zuzana Kocková:
On Planar Graphs Arbitrarily Decomposable into Closed Trails. Graphs Comb. 24(1): 19-28 (2008) - Xinmin Hou, Michelle Edwards:
Paired Domination Vertex Critical Graphs. Graphs Comb. 24(5): 453-459 (2008) - Jianfeng Hou, Yan Zhu, Guizhen Liu, Jianliang Wu, Mei Lan:
Total Colorings of Planar Graphs without Small Cycles. Graphs Comb. 24(2): 91-100 (2008)
skipping 25 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 2025-01-20 09:36 CET 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