Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Art of Discrete and Applied Mathematics, Volume 6
Volume 6, Number 1, October 2022
- John Baptist Gauci, Jean Paul Zerafa
:
A note on fractional covers of a graph. 1 - Karen Meagher, Andriaherimanana Sarobidy Razafimahatratra:
Some Erdös-Ko-Rado results for linear and affine groups of degree two. 1 - Zakir Deniz, Vadim E. Levit, Eugen Mandrescu:
On graphs admitting two disjoint maximum independent sets. 1 - Reji Thankachan, Pavithra Rajamani:
Coupon coloring of lexicographic product of graphs. 1 - Mark Budden, Zoulaiha Daouda:
Star-critical Gallai-Ramsey numbers involving the disjoint union of triangles. 1 - Emily Frost, Dylan Helliwell, Suki Shergill:
A new perspective on taxicab conic sections. 1 - Stefan Gyürki, Pavol János:
On the automorphisms of a family of small q-regular graphs of girth 8. 1 - Haneen Al-Janabi, Gábor Bacsó:
Chromatic uniqueness of zero-divisor graphs. 1 - Saeid Alikhani, Nima Ghanbari, Samaneh Soltani:
Total dominator chromatic number of k-subdivision of graphs. 1 - Riccardo W. Maffucci:
Self-dual polyhedra of given degree sequence. 1
Volume 6, Number 2, November 2022
- Tijo James, Ambat Vijayakumar:
Mycielskian of graphs with small game domination number. 2 - Aleksander Kelenc, Iztok Peterin:
Distance formula for direct-co-direct product in the case of disconnected factors. 2 - Anna Lindeberg, Marc Hellmuth:
Construction of k-matchings in graph products. 2 - Saeid Alikhani, Mohammad Hadi Shekarriz:
Number of colors needed to break symmetries of a graph by an arbitrary edge coloring. 2 - Dulce I. Valdivia, Maribel Hernández-Rosales, Manuela Geiß, Peter F. Stadler, Marc Hellmuth:
Hierarchical and modularly-minimal vertex colorings. 2 - Debra L. Boutin, Sally Cockburn, Lauren Keough, Sarah Loeb, Puck Rombach:
Symmetry parameters of various hypercube families. 2 - Debra L. Boutin:
Paint cost and the frugal distinguishing number. 2 - Rafal Kalinowski, Monika Pilsniak, Magdalena Prorok:
Distinguishing arc-colourings of symmetric digraphs. 2 - Lorenzo Sauras Altuzarra:
Some properties of the factors of Fermat numbers. 2 - Jaroslav Nesetril, Ales Pultr:
Note on strong product graph dimension. 2 - Jamie L. Shive:
Lexicographic palindromic products. 2 - Marston D. E. Conder, Thomas W. Tucker:
The GFR problem and a theorem of Godsil. 2 - Bojan Mohar, Hehui Wu:
Subgraphs of Kneser graphs with large girth and large chromatic number. 2 - Manoj Changat, Arun Anil:
Composition and product of cover-incomparability graphs. 2
Volume 6, Number 3, February 2023
- Toufik Mansour, Mark Shattuck:
Counting occurrences of subword patterns in non-crossing partitions. 3 - Marco Pavone:
A visual representation of the Steiner triple systems of order 13. 3 - Richard A. Brualdi, Geir Dahl:
Permutation graphs and the weak Bruhat order. 3 - Martin Knor, Riste Skrekovski:
On maximum Wiener index of directed grids. 3 - Dave Witte Morris:
Automorphisms of the canonical double cover of a toroidal grid. 3 - Manoj Changat, Prasanth G. Narasimha-Shenoi, Mary Shalet Thottungal Joseph:
Center and periphery of lexicographic product of digraphs. 3 - Joy Morris, Adrian Skelton:
Cayley graphs on abelian and generalized dihedral groups. 3 - Michal Stas, Mária Svecová:
Disconnected spanning subgraphs of paths in the join products with cycles. 3 - Marko Orel:
The core of a vertex transitive complementary prism of a lexicographic product. 3 - Toufik Mansour:
The length of the initial longest increasing sequence in a permutation. 3
a service of 
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 2024-05-15 21:33 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:
