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 82 matches
- 2024
- Aida Abiad, Hidde Koerts:
On the k-independence number of graph products. Discuss. Math. Graph Theory 44(3): 983 (2024) - Messaouda Ahmane, Isma Bouchemakh, Éric Sopena:
On the broadcast independence number of locally uniform 2-lobsters. Discuss. Math. Graph Theory 44(1): 199 (2024) - Saeid Alikhani, Davood Bakhshesh, Hamid R. Golmohammadi, Elena V. Konstantinova:
Connected coalitions in graphs. Discuss. Math. Graph Theory 44(4): 1551-1566 (2024) - Imran Allie, Jordan Arenstein:
Resistance in regular class two graphs. Discuss. Math. Graph Theory 44(2): 727 (2024) - Marcin Anholcer, Azam Sadat Emadi, Doost Ali Mojdeh:
Total vertex product irregularity strength of graphs. Discuss. Math. Graph Theory 44(4): 1261-1276 (2024) - János Barát, Zoltán Blázsik:
General sharp upper bounds on the total coalition number. Discuss. Math. Graph Theory 44(4): 1567-1584 (2024) - Germán Benítez-Bobadilla, Hortensia Galeana-Sánchez, César Hernández-Cruz:
Panchromatic patterns by paths. Discuss. Math. Graph Theory 44(2): 519 (2024) - Brahim Benmedjdoub, Éric Sopena:
Strong incidence colouring of graphs. Discuss. Math. Graph Theory 44(2): 663 (2024) - Julien Bensmail:
On a graph labelling conjecture involving coloured labels. Discuss. Math. Graph Theory 44(1): 231 (2024) - Julien Bensmail:
A \sigma3 condition for arbitrarily partitionable graphs. Discuss. Math. Graph Theory 44(2): 755 (2024) - Julien Bensmail, Foivos Fioravantes:
On proper 2-labellings distinguishing by sums, multisets or products. Discuss. Math. Graph Theory 44(3): 863 (2024) - Piotr Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Hypergraph operations preserving sc-greediness. Discuss. Math. Graph Theory 44(3): 1217 (2024) - Debra L. Boutin, Sally Cockburn, Lauren Keough, Sarah Loeb, K. E. Perry, Puck Rombach:
Determining number and cost of generalized Mycielskian graphs. Discuss. Math. Graph Theory 44(1): 127 (2024) - Carl Johan Casselgren, Fikre B. Petros:
Edge precoloring extension of trees II. Discuss. Math. Graph Theory 44(2): 613 (2024) - Guantao Chen, Zhiquan Hu, Yaping Wu:
A Chvátal-Erdős type theorem for path-connectivity. Discuss. Math. Graph Theory 44(4): 1247-1260 (2024) - Hongzhang Chen, Jianxi Li, Shou-Jun Xu:
Spectral bounds for the zero forcing number of a graph. Discuss. Math. Graph Theory 44(3): 971 (2024) - Jie Chen, Yi-Ping Liang, Shou-Jun Xu:
Semitotal domination in claw-free graphs. Discuss. Math. Graph Theory 44(4): 1585-1605 (2024) - Dongqin Cheng:
The generalized 4-connectivity of balanced hypercubes. Discuss. Math. Graph Theory 44(3): 1079 (2024) - Sylwia Cichacz, Agnieszka Görlich, Karol Suchan:
k-fault-tolerant graphs for p disjoint complete graphs of order c. Discuss. Math. Graph Theory 44(4): 1471-1484 (2024) - Megan Cream, Ronald J. Gould:
Chorded k-pancyclic and weakly k-pancyclic graphs. Discuss. Math. Graph Theory 44(1): 337 (2024) - Colin Defant, David Dong, Alan Lee, Michelle Wei:
Connectedness and cycle spaces of friends-and-strangers graphs. Discuss. Math. Graph Theory 44(3): 1143 (2024) - Jinghua Deng, Jianfeng Hou, Qinghou Zeng:
The Turán number of three disjoint paths. Discuss. Math. Graph Theory 44(4): 1513-1537 (2024) - Devvrit, Aaron Krim-Yee, Nithish Kumar, Gary MacGillivray, Ben Seamone, Virgélot Virgile, Anqi Xu:
Fractional eternal domination: securely distributing resources across a network. Discuss. Math. Graph Theory 44(4): 1395-1428 (2024) - Kamal Dliou, Hicham El Boujaoui, Mustapha Kchikech:
$L(2,1)$-labeling of the iterated Mycielski graphs of graphs and some problems related to matching problems. Discuss. Math. Graph Theory 44(2): 489 (2024) - Masayoshi Doki, Yoshimi Egawa, Naoki Matsumoto:
Graph grabbing game on graphs with forbidden subgraphs. Discuss. Math. Graph Theory 44(1): 171 (2024) - Yiling Dong, Gregory Z. Gutin, Yuefang Sun:
Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs. Discuss. Math. Graph Theory 44(3): 913 (2024) - Changchang Dong, Jixiang Meng, Juan Liu:
Dominated pair degree sum conditions of supereulerian digraphs. Discuss. Math. Graph Theory 44(3): 879 (2024) - Paul Dorbec, Fatma Kaci:
Disjoint maximal independent sets in graphs and hypergraphs. Discuss. Math. Graph Theory 44(4): 1361-1371 (2024) - Leen Droogendijk, Elena V. Konstantinova:
An improved bound on the chromatic number of the Pancake graphs. Discuss. Math. Graph Theory 44(1): 35 (2024) - Christopher Duffy, Todd Mullen:
An analogue of quasi-transitivity for edge-coloured graphs. Discuss. Math. Graph Theory 44(3): 1189 (2024)
skipping 52 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-12-21 11:45 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