default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMostafa Blidia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j37]Lyes Ouldrabah, Mostafa Blidia, Ahmed Bouchou:
Roman domination in oriented trees. Electron. J. Graph Theory Appl. 9(1): 95-103 (2021)- 2020
- [j36]Mostafa Blidia, Ahmed Bouchou, Mustapha Chellali:
Extremal graphs for a bound on the Roman domination number. Discuss. Math. Graph Theory 40(3): 771-785 (2020)
2010 – 2019
- 2019
- [j35]Lyes Ouldrabah, Mostafa Blidia, Ahmed Bouchou:
Extremal digraphs for an upper bound on the Roman domination number. J. Comb. Optim. 38(3): 667-679 (2019) - [j34]Lyes Ouldrabah, Mostafa Blidia, Ahmed Bouchou:
On the k-domination number of digraphs. J. Comb. Optim. 38(3): 680-688 (2019) - [j33]Amel Bendali-Braham, Noureddine Ikhlef Eschouf, Mostafa Blidia:
Some results on the b-chromatic number in complementary prism graphs. RAIRO Oper. Res. 53(4): 1187-1195 (2019) - 2018
- [j32]Amel Bendali-Braham, Noureddine Ikhlef Eschouf, Mostafa Blidia:
A characterization of edge b-critical graphs. Discret. Appl. Math. 238: 158-160 (2018) - 2017
- [j31]Amina Ramoul, Mostafa Blidia:
A new generalization of kernels in digraphs. Discret. Appl. Math. 217: 673-684 (2017) - 2015
- [j30]Noureddine Ikhlef Eschouf, Mostafa Blidia, Frédéric Maffray:
On edge-b-critical graphs. Discret. Appl. Math. 180: 176-180 (2015) - 2014
- [j29]Ahmed Bouchou, Mostafa Blidia:
On the k-independence number in graphs. Australas. J Comb. 59: 311-322 (2014) - [j28]Mostafa Blidia, Ahmed Bouchou, Lutz Volkmann:
Bounds on the k-independence and k-chromatic numbers of graphs. Ars Comb. 113: 33-46 (2014) - [j27]Ahmed Bouchou, Mostafa Blidia, Mustapha Chellali:
Relations between the Roman k-domination and Roman domination numbers in graphs. Discret. Math. Algorithms Appl. 6(3) (2014) - 2013
- [j26]Soufiane Khelifi, Mostafa Blidia, Mustapha Chellali, Frédéric Maffray:
ERRATUM to: Double domination edge removal critical graphs. Australas. J Comb. 55: 315- (2013) - [j25]Ahmed Bouchou, Mostafa Blidia:
Criticality indices of Roman domination of paths and cycles. Australas. J Comb. 56: 103-112 (2013) - [j24]Mostafa Blidia, Nacéra Meddah:
A characterization of trees for new lower bound on the k-independence number. Discuss. Math. Graph Theory 33(2): 395-410 (2013) - 2012
- [j23]Mostafa Blidia, Noureddine Ikhlef Eschouf, Frédéric Maffray:
b-coloring of some bipartite graphs. Australas. J Comb. 53: 67-76 (2012) - 2011
- [j22]Mostafa Blidia, Widad Dali:
A characterization of locating-total domination edge critical graphs. Discuss. Math. Graph Theory 31(1): 197-202 (2011) - [j21]Mostafa Blidia, Ahmed Bouchou:
On sequences (γk) and (βk) in regular graphs. Stud. Inform. Univ. 9(2): 7-18 (2011) - 2010
- [j20]Mostafa Blidia, Lyes Ould-Rabah:
Bounds on the domination number in oriented graphs. Australas. J Comb. 48: 231-242 (2010) - [j19]Soufiane Khelifi, Mostafa Blidia, Mustapha Chellali, Frédéric Maffray:
Double domination edge removal critical graphs. Australas. J Comb. 48: 285- (2010)
2000 – 2009
- 2009
- [j18]Mostafa Blidia, Widad Dali:
A characterization of locating-domination edge critical graphs. Australas. J Comb. 44: 297-300 (2009) - [j17]Mostafa Blidia, Frédéric Maffray, Zoham Zemir:
On b-colorings in regular graphs. Discret. Appl. Math. 157(8): 1787-1793 (2009) - 2008
- [j16]Mostafa Blidia, Odile Favaron, Rahma Lounes:
Locating-domination, 2-domination and independence in trees. Australas. J Comb. 42: 309- (2008) - [j15]Mostafa Blidia, Mustapha Chellali, Frédéric Maffray:
Extremal perfect graphs for a bound on the domination number. Discret. Math. 308(10): 1785-1791 (2008) - [j14]Mostafa Blidia, Mustapha Chellali, Odile Favaron, Nacéra Meddah:
Maximal k-independent sets in graphs. Discuss. Math. Graph Theory 28(1): 151-163 (2008) - 2007
- [j13]Mostafa Blidia, Mustapha Chellali, Frédéric Maffray, Julien Moncel, Ahmed Semri:
Locating-domination and identifying codes in trees. Australas. J Comb. 39: 219-232 (2007) - [j12]Mostafa Blidia, Mustapha Chellali, Odile Favaron, Nacéra Meddah:
On k-independence in graphs with emphasis on trees. Discret. Math. 307(17-18): 2209-2216 (2007) - 2006
- [j11]Mostafa Blidia, Mustapha Chellali, Teresa W. Haynes:
Characterizations of trees with equal paired and double domination numbers. Discret. Math. 306(16): 1840-1845 (2006) - [j10]Mostafa Blidia, Mustapha Chellali, Lutz Volkmann:
Some bounds on the p-domination number in trees. Discret. Math. 306(17): 2031-2037 (2006) - [j9]Mostafa Blidia, Mustapha Chellali, Frédéric Maffray:
Extremal graphs for a new upper bound on domination parameters in graphs. Discret. Math. 306(19-20): 2314-2326 (2006) - 2005
- [j8]Mostafa Blidia, Mustapha Chellali, Odile Favaron:
Independence and 2-domination in trees. Australas. J Comb. 33: 317-328 (2005) - [j7]Mostafa Blidia, Mustapha Chellali, Frédéric Maffray:
On average lower independence and domination numbers in graphs. Discret. Math. 295(1-3): 1-11 (2005) - [j6]Mostafa Blidia, Mustapha Chellali, Lutz Volkmann:
On the p-domination number of cactus graphs. Discuss. Math. Graph Theory 25(3): 355-361 (2005)
1990 – 1999
- 1999
- [j5]Mostafa Blidia, Pierre Duchet, Henry Jacob, Frédéric Maffray, Henry Meyniel:
Some operations preserving the existence of kernels. Discret. Math. 205(1-3): 211-216 (1999) - 1994
- [j4]Mostafa Blidia, Pierre Duchet, Frédéric Maffray:
On the orientation of meyniel graphs. J. Graph Theory 18(7): 705-711 (1994) - 1993
- [j3]Mostafa Blidia, Pierre Duchet, Frédéric Maffray:
On kernels in perfect graphs. Comb. 13(2): 231-233 (1993) - 1992
- [j2]Mostafa Blidia, Konrad Engel:
Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable. Graphs Comb. 8(2): 103-108 (1992)
1980 – 1989
- 1986
- [j1]Mostafa Blidia:
A parity diagraph has a kernel. Comb. 6(1): 23-27 (1986)
Coauthor Index
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-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
