Contributions to Discrete Mathematics, Volume 12 (original) (raw)



default search action
- combined dblp search
- author search
- venue search
- publication search
Authors:
- no matches

Venues:
- no matches

Publications:
- no matches



SPARQL queries 
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Volume 12, Number 1, 2017
Articles

Thomas Jahn
:
Geometric Algorithms for Minimal Enclosing Disks in Strictly Convex Normed Planes.

Babak Samadi
, Hamidreza Golmohammadi, Abdollah Khodkar:
Bounds on several versions of restrained domination number.

Olivia Yao, Chao Gu, Yinghua Ma:
Congruences modulo powers of 2 and 3 for a restricted binary partition function a la Andrews and Lewis.

Shuichi Tsukuda:
Independence complexes and incidence graphs.

Margaret-Ellen Messinger:
Closing the Gap: Eternal Domination on 3 x n Grids.

Samuel Coskey, Paul Ellis
:
The conjugacy problem for automorphism groups of homogeneous digraphs.

Paola Bonacini, Lucia Marino:
On the spectrum of octagon quadrangle systems of any index.

Mario Gionfriddo, Giovanni Lo Faro, Salvatore Milici, Antoinette Tripodi:
α-Resolvable λ-fold G-designs.

Manouchehr Zaker:
First-Fit coloring of Cartesian product graphs and its defining sets.

Marcin Peczarski:
Comments on the Golden Partition Conjecture.

Anthony Bonato, Gary MacGillivray:
Characterizations and algorithms for generalized Cops and Robbers games.

Naoki Matsumoto:
Conjectures on uniquely 3-edge-colorable graphs.

Paola Bonacini, Maria Di Giovanni, Mario Gionfriddo, Lucia Marino, Antoinette Tripodi:
The Spectrum of Balanced P^(3)(1, 5)-Designs.

K. M. Kathiresan, S. Sabarimalai Madha:
Star super edge magic deficiency of graphs.

Anurag Bishnoi, Ferdinand Ihringer:
Some non-existence results for distance-$j$ ovoids in small generalized polygons.
Volume 12, Number 2, 2017
Articles

R. Lenin, Kumarappan Kathiresan, Martin Baca:
The Forcing Strong Metric Dimension of a Graph.

Randy Davila, Caleb Fast, Michael A. Henning, Franklin Kenter:
Lower Bounds on the Distance Domination Number of a Graph.

Alex Fink, Richard K. Guy:
The Outercoarseness of the n-cube.

Megha Goyal:
On combinatorial extensions of Rogers-Ramanujan type identities.

Hong Gao, Huiping Cao, Yuansheng Yang:
On the total signed domination number of the Cartesian product of paths.

Kevin N. Vander Meulen, Adam Van Tuyl:
Shellability, vertex decomposability, and lexicographical products of graphs.

Sharareh Alipour, Amir Jafari:
On Chromatic Number of General Kneser Graphs.

P. Anusha Devi, S. Monikandan:
Degree Associated Reconstruction Parameters of Total Graphs.

Michael A. Henning, William Klostermeyer, Gary MacGillivray:
Bounds for the mmm-Eternal Domination Number of a Graph.

Tomás Vetrík:
On the metric dimension of circulant graphs with 444 generators.

Meenakshi Rana, J. K. Sareen:
Split (n + t)-color partitions and 2-color F-partitions.

Pedro Martín, Horst Martini, Margarita Spirova:
Ball hulls, ball intersections, and 2-center problems for gauges.

Marcin Anholcer, Sylwia Cichacz
:
Group Irregular Labelings of Disconnected Graphs.

Domingos Moreira Cardoso, Charles Dominic, Lukasz Witkowski, Marcin Witkowski:
On Cops and Robbers on GXiG^{\Xi}GXi and cop-edge critical graphs.

Gabe Cunningham, Mark Mixer:
Internal and external duality in abstract polytopes.

Norbert Sauer, Imed Zaguia:
Permutations avoiding connected graphs.

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).
load links from unpaywall.org
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).
load content from archive.org
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
.
load data from openalex.org
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.
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:







