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 384 matches
- 2024
- Jarne Renders, Shin-ichi Tokunaga, Carol T. Zamfirescu:
Domination of triangulated discs and maximal outerplanar graphs. Appl. Math. Comput. 473: 128648 (2024) - Yasufumi Aita, Toru Araki:
Secure total domination number in maximal outerplanar graphs. Discret. Appl. Math. 353: 65-70 (2024) - Toru Araki:
A lower bound for secure domination number of an outerplanar graph. Discret. Appl. Math. 357: 81-85 (2024) - Zemin Jin, Rui Yu, Yuefang Sun:
Anti-Ramsey number of matchings in outerplanar graphs. Discret. Appl. Math. 345: 125-135 (2024) - Yunping Li, Hanyuan Deng, Zikai Tang:
Sombor index of maximal outerplanar graphs. Discret. Appl. Math. 356: 96-103 (2024) - Tai-Yu Su:
Minimum spanning tree cycle intersection problem on outerplanar graphs. Discret. Appl. Math. 343: 328-339 (2024) - Wei Yang, Baoyindureng Wu:
Outer connected domination in maximal outerplanar graphs and beyond. Discuss. Math. Graph Theory 44(2): 575 (2024) - Deivanai Jaisankar, Sujatha Ramalingam, Deivanayagampillai Nagarajan, Tadesse Walelign:
Fuzzy Outerplanar Graphs and Its Applications. Int. J. Comput. Intell. Syst. 17(1): 231 (2024) - Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
The Canadian Traveller Problem on Outerplanar Graphs. MFCS 2024: 19:1-19:16 - Maximilian Gorsky, Fabian Kreßin:
Computing the forcing spectrum of outerplanar graphs in polynomial time. CoRR abs/2401.17704 (2024) - Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
The Canadian Traveller Problem on outerplanar graphs. CoRR abs/2403.01872 (2024) - Yasufumi Aita, Toru Araki:
Secure Total Domination Number in Maximal Outerplanar Graphs. CoRR abs/2403.03404 (2024) - Toru Araki:
A Lower bound for Secure Domination Number of an Outerplanar Graph. CoRR abs/2403.06493 (2024) - Therese Biedl, Debajyoti Mondal:
Improved Outerplanarity Bounds for Planar Graphs. CoRR abs/2407.04282 (2024) - 2023
- Allan Bickle:
2-Tone coloring of chordal and outerplanar graphs. Australas. J Comb. 87: 182-197 (2023) - Joyce Bacic, Saeed Mehrabi, Michiel Smid:
Shortest Beer Path Queries in Outerplanar Graphs. Algorithmica 85(6): 1679-1705 (2023) - Johannes Carmesin, Tsvetomir Mihaylov:
Outerspatial 2-Complexes: Extending the Class of Outerplanar Graphs to Three Dimensions. Electron. J. Comb. 30(3) (2023) - Ziv Bakhajian, Ohad Noy Feldheim:
Drawing outerplanar graphs using thirteen edge lengths. Comput. Geom. 110: 101964 (2023) - Wayne Goddard, Michael A. Henning:
Independent domination in outerplanar graphs. Discret. Appl. Math. 325: 52-57 (2023) - Fatemeh Sadat Mousavi, Masoumeh Nouri:
Strong incidence coloring of outerplanar graphs. Discret. Appl. Math. 338: 293-301 (2023) - Akihiro Higashitani, Naoki Matsumoto:
The ratio of the numbers of odd and even cycles in outerplanar graphs. Discret. Math. 346(4): 113285 (2023) - Jean-Christophe Godin, Olivier Togni:
Choosability with separation of cycles and outerplanar graphs. Discuss. Math. Graph Theory 43(3): 743-760 (2023) - Mahsa Mozafari-Nia, Moharram N. Iradmusa:
Simultaneous coloring of vertices and incidences of outerplanar graphs. Electron. J. Graph Theory Appl. 11(1): 245-262 (2023) - Sparsh Jain, Sreejith K. Pallathumadam, Deepak Rajendraprasad:
B0-VPG Representation of AT-free Outerplanar Graphs. J. Graph Algorithms Appl. 27(9): 853-869 (2023) - Guyslain Naves, F. Bruce Shepherd, Henry Xia:
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators. Math. Program. 197(2): 1049-1067 (2023) - Francisco Alejandro Madera-Ramírez, Joel Antonio Trejo-Sánchez, José Luis López-Martínez, Jorge Ríos-Martínez:
Crossing edge minimization in radial outerplanar layered graphs using segment paths. Optim. Methods Softw. 38(6): 1142-1162 (2023) - Paul Jungeblut, Laura Merker, Torsten Ueckerdt:
Directed Acyclic Outerplanar Graphs Have Constant Stack Number. FOCS 2023: 1937-1952 - Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu:
Splitting Plane Graphs to Outerplanarity. WALCOM 2023: 217-228 - Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu:
Splitting Plane Graphs to Outerplanarity. CoRR abs/2301.09440 (2023) - 2022
- Ying Wang, Yiqiao Wang, Weifan Wang, Shuyu Cui:
Strong Chromatic Index of Outerplanar Graphs. Axioms 11(4): 168 (2022)
skipping 354 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-09-22 04:01 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