default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volumes 190-191
Volumes 190-191, August 2015
- Faisal N. Abu-Khzam, Carl Feghali, Haiko Müller
:
Partitioning a graph into disjoint cliques and a triangle-free graph. 1-12 - Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa:
On the Galois lattice of bipartite distance hereditary graphs. 13-23 - Camino Balbuena, Julián Salas:
On a conjecture on the order of cages with a given girth pair. 24-33 - Xiaohan Cheng, Danjun Huang, Guanghui Wang, Jian-Liang Wu:
Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ. 34-41 - Rosena R. X. Du, Yingying Nie, Xuezhi Sun:
Enumerations of humps and peaks in (k, a)-paths and (n, m)-Dyck paths via bijective proofs. 42-49 - Sylvain Gravier, Michel Mollard, Simon Spacapan, Sara Sabrina Zemljic:
On disjoint hypercubes in Fibonacci cubes. 50-55 - Jiao Gu, Bobo Hua, Shiping Liu:
Spectral distances on graphs. 56-74 - Sonja Hohloch:
Optimal transport and integer partitions. 75-85 - Michael Holzhauser, Sven Oliver Krumke, Clemens Thielen:
Convex generalized flows. 86-99 - Matthew Johnson, Daniël Paulusma, Anthony Stewart:
Knocking out Pk-free graphs. 100-108 - Ivo Koch, Iztok Peterin:
The b-chromatic index of direct product of graphs. 109-117 - Qiuli Li, Wai Chee Shiu, Haiyuan Yao:
Matching preclusion for cube-connected cycles. 118-126 - Pablo Daniel Torres, Mario Valencia-Pabon:
The packing chromatic number of hypercubes. 127-140 - Mingyu Xiao, Hiroshi Nagamochi:
Exact algorithms for dominating induced matching based on graph partition. 147-162
- Suil O, Douglas B. West:
Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs. 163-168
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.
last updated on 2025-02-21 19:35 CET 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:
