default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDC. N. Campos
Person information
- affiliation: University of Campinas, Sao Paulo, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2006
[b1]Christiane Neme Campos:
O problema da coloração total em classes de grafos. University of Campinas, Brazil, 2006
Journal Articles
- 2023
- [j20]C. A. Weffort-Santos, C. N. Campos, Rafael C. S. Schouery
:
On gap-labellings of some families of graphs. Discret. Appl. Math. 340: 296-314 (2023) - 2022
- [j19]Atílio G. Luiz, C. N. Campos:
Neighbour-Distinguishing Labellings of Families of Graphs. Graphs Comb. 38(3): 95 (2022) - 2020
- [j18]Atílio G. Luiz, C. N. Campos, R. Bruce Richter:
On 0-Rotatable Graceful Caterpillars. Graphs Comb. 36(6): 1655-1673 (2020) - [j17]Atílio G. Luiz, C. N. Campos, Simone Dantas, Diana Sasaki:
Neighbour-distinguishing labellings of powers of paths and powers of cycles. J. Comb. Optim. 39(4): 1038-1059 (2020) - 2019
- [j16]Atílio G. Luiz, C. N. Campos, R. Bruce Richter:
On α-labellings of lobsters and trees with a perfect matching. Discret. Appl. Math. 268: 137-151 (2019) - 2017
- [j15]Atílio G. Luiz, C. N. Campos, Célia Picinin de Mello:
AVD-total-chromatic number of some families of graphs with Δ(G)=3. Discret. Appl. Math. 217: 628-638 (2017) - 2015
- [j14]Atílio G. Luiz, C. N. Campos, Célia Picinin de Mello:
AVD-total-colouring of complete equipartite graphs. Discret. Appl. Math. 184: 189-195 (2015) - [j13]Atílio G. Luiz, C. N. Campos, Simone Dantas, Diana Sasaki:
The 1, 2-Conjecture for powers of cycles. Electron. Notes Discret. Math. 50: 83-88 (2015) - 2014
- [j12]Kaio Karam, C. N. Campos:
Fulkerson's Conjecture and Loupekine snarks. Discret. Math. 326: 20-28 (2014) - 2013
- [j11]C. N. Campos, Yoshiko Wakabayashi:
On dominating sets of maximal outerplanar graphs. Discret. Appl. Math. 161(3): 330-335 (2013) - [j10]Kaio Karam, C. N. Campos:
Fulkerson's Conjecture and Loupekine snarks. Electron. Notes Discret. Math. 44: 333-338 (2013) - [j9]C. N. Campos, Simone Dantas, Célia Picinin de Mello:
Colouring Clique-Hypergraphs of Circulant Graphs. Graphs Comb. 29(6): 1713-1720 (2013) - 2012
- [j8]C. N. Campos, Celina M. H. de Figueiredo, Raphael Machado, Célia Picinin de Mello:
The total chromatic number of split-indifference graphs. Discret. Math. 312(17): 2690-2693 (2012) - 2011
- [j7]C. N. Campos, Simone Dantas, Célia Picinin de Mello:
The total-chromatic number of some families of snarks. Discret. Math. 311(12): 984-988 (2011) - 2008
- [j6]C. N. Campos, Célia Picinin de Mello:
The total chromatic number of some bipartite graphs. Ars Comb. 88 (2008) - [j5]C. N. Campos, Simone Dantas, Célia Picinin de Mello:
Colouring clique-hypergraphs of circulant graphs. Electron. Notes Discret. Math. 30: 189-194 (2008) - 2007
- [j4]C. N. Campos, Célia Picinin de Mello:
A result on the total colouring of powers of cycles. Discret. Appl. Math. 155(5): 585-597 (2007) - 2005
- [j3]C. N. Campos, Simone Dantas, Luérbio Faria, Sylvain Gravier:
2K2-Partition Problem. Electron. Notes Discret. Math. 22: 217-221 (2005) - [j2]C. N. Campos, Célia Picinin de Mello:
The total chromatic number of some bipartite graphs. Electron. Notes Discret. Math. 22: 557-561 (2005) - 2004
- [j1]C. N. Campos, Célia Picinin de Mello:
A result on the total colouring of powers of cycles. Electron. Notes Discret. Math. 18: 47-52 (2004)
Conference and Workshop Papers
- 2019
- [c2]Celso A. Weffort-Santos, C. N. Campos, Rafael C. S. Schouery:
On the Complexity of Gap-[2]-vertex-labellings of Subcubic Bipartite Graphs. LAGOS 2019: 725-734 - 2012
- [c1]Kaio Karam, Christiane Neme Campos:
Fulkerson's Conjecture and Loupekine's Snarks. CTW 2012: 162-165
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 2025-06-17 00:12 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:
