Остановите войну!
for scientists:
default search action
Hajo Broersma
- > Home > Persons > Hajo Broersma
Publications
- 2009
- [j98]Xueliang Li, Xiangmei Yao, Wenli Zhou, Hajo Broersma:
Complexity of conditional colorability of graphs. Appl. Math. Lett. 22(3): 320-324 (2009) - 2008
- [j89]Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still:
Some families of integral graphs. Discret. Math. 308(24): 6383-6391 (2008) - 2007
- [j84]Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still:
Integral trees of diameter 6. Discret. Appl. Math. 155(10): 1254-1266 (2007) - [j74]Hajo Broersma, Xueliang Li:
On the complexity of dominating set problems related to the minimum all-ones problem. Theor. Comput. Sci. 385(1-3): 60-70 (2007) - 2005
- [j68]Hajo Broersma, Xueliang Li, Gerhard J. Woeginger, Shenggui Zhang:
Paths and cycles in colored graphs. Australas. J Comb. 31: 299-312 (2005) - 2004
- [j65]Liming Xiong, Hajo Broersma, Xueliang Li, Mingchu Li:
The hamiltonian index of a graph and its branch-bonds. Discret. Math. 285(1-3): 279-288 (2004) - 2002
- [j55]Hajo Broersma, Xueliang Li:
Some approaches to a conjecture on short cycles in digraphs. Discret. Appl. Math. 120(1-3): 45-53 (2002) - [j54]Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li:
Degree sums and subpancyclicity in line graphs. Discret. Math. 242(1-3): 255-267 (2002) - [j51]Hajo Broersma, Xueliang Li:
Isomorphisms and traversability of directed path graphs. Discuss. Math. Graph Theory 22(2): 215-228 (2002) - [j49]Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang:
A Fan Type Condition For Heavy Cycles in Weighted Graphs. Graphs Comb. 18(1): 193-200 (2002) - 2001
- [j46]Hajo Broersma, Xueliang Li, Shenggui Zhang:
A σ3 type condition for heavy cycles in weighted graphs. Discuss. Math. Graph Theory 21(2): 159-166 (2001) - [j44]Xueliang Li, Shenggui Zhang, Hajo Broersma:
Paths and Cycles in Colored Graphs. Electron. Notes Discret. Math. 8: 128-132 (2001) - 2000
- [j40]Shenggui Zhang, Xueliang Li, Hajo Broersma:
Heavy paths and cycles in weighted graphs. Discret. Math. 223(1-3): 327-336 (2000) - 1997
- [j28]Hajo Broersma, Xueliang Li:
Spanning trees with many or few colors in edge-colored graphs. Discuss. Math. Graph Theory 17(2): 259-269 (1997) - 1996
- [j27]Hajo Broersma, Xueliang Li:
The connectivity of the leaf-exchange spanning tree graph of a graph. Ars Comb. 43 (1996) - 1993
- [j16]Hajo Broersma, Xueliang Li:
On "The Matching Polynomial of a Polygraph". Discret. Appl. Math. 46(1): 79-86 (1993) - 1992
- [j7]Haitze J. Broersma, Xueliang Li:
The connectivity of the basis graph of a branching greedoid. J. Graph Theory 16(3): 233-237 (1992)
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.
last updated on 2024-02-07 03:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint