yusuke1997/dblp-id-title huggingface dataset:
Weakly completable critical sets for proper vertex and edge colourings of graphs
Lambda-fold cube decompositions
Regular pinched maps
Vertex-magic labelings: mutations
Dimension 4 and dimension 5 graphs with minimum edge set
Isomorphisms and normality of Cayley digraphs of A 5
On the volume of trades in triple systems
Excess graphs and bicoverings
Monochromatic sinks in 3-switched tournaments
Isomorphisms and automorphism groups of a class of Cayley digraphs on Abelian groups
Path decompositions and perfect path double covers
On magicness and antimagicness of the union of 4-regular circulant graphs
Packing and covering the complete graph with cubes
The chromaticity of a generalized wheel graph
Edge reconstruction and the swapping number of a graph
Homogeneous cartesian products
t-partitions and s-complete t-partitions of a graph
The maximum product of sizes of cross-t-intersecting uniform families
On the normality of Cayley digraphs of valency 2 on non-abelian groups of odd square free order
Characterization of some b-chromatic edge critical graphs
Neighborhood conditions for graphs and digraphs to be maximally edge-connected
Perfect difference families and related variable-weight optical orthogonal codes
Decompositions of some classes of regular graphs and digraphs into cycles of length 4p
The Erdős-Sós conjecture for spiders of diameter 9
Randomly r-orthogonal (0, f)-factorizations of (0, mf-m+1)-graphs
Some new non-Schurian association schemes on 2p 2 points, p an odd prime, and related combinatorial structures
Vertex disjoint cycles for star free graphs
Classes of graphs that can be partitioned to satisfy all their vertices
Minimal unavoidable sets of cycles in plane graphs with restricted minimum degree and edge weight
On weighted Ramsey numbers
The degree-diameter problem for plane graphs with pentagonal faces
Young classes of permutations
Maximal planar graphs and diagonal operations
On certain 2-rotational cycle systems of complete graphs
Forbidden-minors for splitting binary gammoids
The geometric points of coverings
Corrigendum and extension to the "Hamiltonicity in directed Toeplitz graphs $T_{n}\langle 1, 2; t_1, t_2 \rangle$"
Palindromes in starlike trees
Two vignettes on full rook placements
Scenic graphs II: non-traceable graphs
On a conjecture involving cycle-complete graph Ramsey numbers
On the weighing matrices of order 4n and weight 4n-2 and 2n-1
Imbalance in tournament designs
A result on 2k-cycle-free bipartite graphs
Minimally connected $r$-uniform hypergraphs
2-domination in bipartite graphs with odd independence number
On the Loebl-Komlós-Sós conjecture
Quasigroups, isotopisms and authentication schemes
A note on regular factors in vertex-deleted subgraphs of regular bipartite graphs
Critical sets in equi-orthogonal frequency squares
On the powers in the Thue-Morse word
Weak critical sets in cyclic Latin squares
On clique polynomials
Firefighting on trees and Cayley graphs
Cyclic type factorizations of complete bipartite graphs into hypercubes
Evenly partite bigraph-factorization of symmetric complete tripartite digraphs
The ambiguity problem arising in multisensor data association
Closed neighborhood order dominating functions
The combinatorics of rim hook tableaux
MaxDDBS problem on butterfly networks
Total coloring of corona product of two graphs
On minimal outerplanar graphs of given diameter
Generalized clique coverings of chordal graphs
Duplicated Steiner triple systems with self-orthogonal near resolutions
The chromatic number of ordered graphs with constrained conflict graphs
The intersection problem for cubes
The convex hull of every optimal pseudolinear drawing of K n is a triangle
All regular graphs of small odd order are vertex-magic
Roman bondage numbers of some graphs
Optimal orientation of the tensor product of a small diameter graph and a complete graph
Anti-van der Waerden numbers of graph products
Well primitive digraphs
Lower bound on the weakly connected domination number of a tree
Path designs P(v, 3, 1) and P(v, 4, 1) with ovals
Closed-neighborhood union-closed graphs
Classes of cubic graphs containing cycles of integer-power lengths
A-efficient balanced treatment incomplete block designs
The minimum number of vertices of graphs containing two monochromatic triangles for any edge $2$-coloring
Progressions of squares
Factorization of complete graphs into three factors with the smallest diameter equal to 3 or 4
Cocyclic Hadamard matrices over ℤ t × ℤ 2 2
Ramsey numbers in rainbow triangle free colorings
A note on the existence of balanced (q, {3, 4}, 1) difference families
Edge-neighbor-integrity of trees
Cyclic critical groups of graphs
Related decompositions and new constructions of the Higman-Sims and Hall-Janko graphs
Constructions of 3-resolvable nested 3-designs and 3-wise balanced designs
On the number of minimal completely separating systems and antichains in a Boolean lattice
Total domination of random regular graphs
Maximum packings of inside perfect 8-cycle systems
Further results on antimagic graph labelings
The expansion of polynomial invariants for 2-decompositions of generalized graphs
Locally finite sublattices of free lattices
Ring-magic labelings of graphs
The metamorphosis of lambda-fold 4-wheel systems into lambda-fold bowtie systems
On the upper bound of the minimum length of 5-dimensional linear codes
A characterization of trees with equal total domination and paired-domination numbers
On totally magic injections
Minimally triangle-saturated graphs: adjoining a single vertex
Some properties of minimal arbitrarily partitionable graphs
Fibonacci numbers, ordered partitions, and transformations of a finite set
Characterizing factor critical graphs and an algorithm
On co-regular signed graphs
Minimum degree conditions for the Overfull Conjecture for odd order graphs
Rainbow matchings and transversals
The metric dimension of small distance-regular and strongly regular graphs
Trees with strong equality between the Roman domination number and the unique response Roman domination number
Color-induced subgraphs of Grünbaum colorings of triangulations of the sphere
On the super edge-magic deficiencies of graphs
Corrigendum: Maximum packings of K n with hexagons
Whitney's theorem for 2-regular planar digraphs
Permanent rank and transversals
Cycles through a given arc in certain almost regular multipartite tournaments
On the classification of 2-extendable Cayley graphs on dihedral groups
Self-converse Mendelsohn designs with odd block size
Signed Langford sequences and directed cyclic cycle systems
Non-uniform covering array with symmetric forbidden edge constraints
On the vertex arboricity of graphs with prescribed size
A note on Grundy colorings of central graphs
Magic labellings of graphs over finite abelian groups
The birank number of ladder, prism and Mobius ladder graphs
Counting peaks on graphs
Directed packings with block size 5
Sharp bounds on the size of pairable graphs and pairable bipartite graphs
Even time constraints on the watchman's walk
Group-magic labelings and null sets of complete n-partite graphs with a deleted edge
Edge-magic total labelings
Interpolation theorems for the (r, s)-domination number of spanning trees
Small graphs are reconstructible
Factorizations of complete multigraphs
A small embedding for large directed even cycle systems
A bound for s-distance permutation families and explicit Ramsey graphs
Classroom note: Almost-isosceles right-angled triangles
On the spectral radius of nonnegative matrices
On the basis number of the direct product of graphs
Merging combinatorial design and optimization: the Oberwolfach problem
Primitive generators for cyclic vector spaces over a Galois field
Antipodal triple systems
A construction of vertex-transitive non-Cayley graphs
A note on the Caro-Tuza bound on the independence number of uniform hypergraphs
Trees whose domination subdivision number is one
The existence of resolvable Mendelsohn designs RMD({3, s * }, v)
Graph-functions associated with an edge-property
Symmetry and unimodality of independence polynomials of path-like graphs
Defective circular coloring
Grünbaum coloring and its generalization to arbitrary dimension
k-regular antichains on [m] with k ≤ m-2
Embeddings and faithful enclosings of GDDs with a constant number of groups
On facets of the three-index assignment polytope
Diagonally switchable 4-cycle systems
A conjecture of Goodman and the multiplicities of graphs
The α-labeling number of bipartite graphs
A formula for the generating functions of powers of Horadam's sequence
Optimal double circulant self-dual codes over 𝔽 4 II
5-cycle decompositions from paired 3- and 4-cycle decompositions
A construction of optimal sets of FH sequences
Pyramids of segments: nice new formulas with bijective proofs
Some new large sets of t-designs
Non-Cayley-Isomorphic Cayley graphs from non-Cayley-Isomorphic Cayley digraphs
Equitably 2-colourable even cycle systems
Hyperovals
Quasi-embeddings and intersections of latin squares of different orders
A two dimensional Steinhaus theorem
Tic-Tac-Toe on graphs
Closure of K 1 + 2K 2 -free graphs
Nonseparating vertices in tournaments with large minimum degree
Finding D-optimal designs by randomised decomposition and switching
Path-cordial abelian groups
How big is your mathematics?
On the existence of three incomplete idempotent MOLS
Graphs with the cycle extension property
Progress on the Hall-Number-Two problem
On connected (γ, k)-critical graphs
On extremal graphs with exactly one Steiner tree connecting any k vertices
Size Ramsey results for paths versus stars
Ehrhart's polynomial for equilateral triangles in ℤ 3
A family of translation planes
The Fibonacci hypercube
On the cycle structure of in-tournaments
A sufficient condition for spanning trees with bounded maximum degree in a graph
On local connectivity of K 2, p -free graphs
Extended partial order and applications to tensor products
Which digraphs are round?
Smallest defining sets for 2-(10, 5, 4) designs
Note on Hadamard groups and difference sets
Connected odd factors of graphs
Single-machine scheduling to minimize absolute lateness for a specified number of tardy jobs
HAHA designs
On the mean connected induced subgraph order of cographs
Stabilizers for GF(5)-representable matroids
Covering relations of k-Grassmannian permutations of type B
Cycle-up-down permutations
Factorial properties of graphs
On the centroid of recursive trees
Latin k-hypercubes
Distance magic labelings of graphs
A class of totally antimagic total graphs
The Cayley graphs of prime-square order which are Cayley invariant
A method for constructing symmetric Hamiltonian double Latin squares
On the products of group-magic graphs
The induced path number of the complements of some graphs
More constructions of vertex-transitive non-Cayley graphs based on counting closed walks
An involution on bicubic maps and β(0, 1)-trees
Longest paths through an arc in strongly connected in-tournaments
Orthogonal Latin square graphs based on groups of order 8
On the integer-magic spectra of tessellation graphs
Super (a, d)-H-antimagic total labelings for shackles of a connected graph H
Some results on the f-chromatic index of graphs whose f-core has maximum degree 2
Interpolation theorems in jump graphs
Avoiding bias in cards cryptography
On packing designs with block size 5 and indices 3 and 5
Some series of block designs with nested rows and columns
BLT-sets admitting the symmetric group S 4
Some bicyclic antiautomorphisms of directed triple systems
On uniformly balanced graphs
A note on independent domination in graphs of girth 5
Note on a class of (q+1)-sets of PG(3, q)
Universal obstructions for embedding extension problems
On two open problems concerning weak Roman domination in trees
Some constructions for 1-rotational BIBD's with block size 5
Embeddings in Eulerian graceful graphs
Functions of finite simplicial complexes that are not locally determined
On optimal orientations of tree vertex-multiplications
Nesting kite and 4-cycle systems
A matching algorithm with applications to bus operations
New domination conditions for tournaments
Anti-Ramsey multiplicities
An approximate algorithm for combinatorial optimization problems with two parameters
Supplementary difference sets related to a certain class of complex spherical 2-codes
The plurality strategy on graphs
Finite field Nullstellensatz and Grassmannians
ℤ k -magic labellings of fans and wheels with magic value zero
Small radial Moore graphs of radius 3
A note on the existence of factors in squares of graphs
A note on critical sets
Connected pseudoachromatic index of complete graphs
Two invariants for adjointly equivalent graphs
Weak Lefschetz property and stellar subdivisions of Gorenstein complexes
Recent results on combinatorial constructions for threshold schemes
On isomorphisms of Cayley digraphs on dicyclic groups
On the existence of (K 1, 3 , λ)-frames of type g u
An algorithm for determining connectedness of tetravalent metacirculant graphs
Revisiting the intersection problem for minimum coverings of complete graphs with triples
P 7 -factorization of complete bipartite graphs
The permutation classes Av(1234, 2341) and Av(1243, 2314)
Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree
Differences between detour and Wiener indices
Supertough graphs need not be K 1, 3 -free
On the rainbow k-connectivity of complete graphs
Enumeration of certain binary vectors
The nonexistence of a distance-regular graph with intersection array $\{75, 64, 22, 1; 1, 2, 64, 75\}$
Existence of 2-perfect GD6CSs
The 3-colored Ramsey number for a 3-uniform loose path of length 3
Failed power domination on graphs
The 4-choosability of planar graphs without 6-cycles
Some new classes of integral trees with diameters 4 and 6
An extremal type I self-dual code of length 16 over 𝔽 2 +u𝔽 2
On the density of sumsets and product sets
Complete-factors and (g, f)-covered graphs
Right-invariant generalized metrics applied to rank correlation coefficients
A note on orbit graphs of finite groups and colour-clique graphs of Cayley graphs
Diletter and triletter comma-free codes over finite alphabets
The automorphism group of the toroidal queen's graph
Remarks on hamiltonian digraphs
Block-transitive designs and maximal subgroups of finite symmetric groups
Matrix constructions of family (A) group divisible designs
Pure Latin directed triple systems
Planar graphs with no incident triangles and no 4- or 5-cycles are (7:2)-colorable
The tight bound on the number of C_3-free vertices on regular 3-partite tournaments
Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
On defective colourings of triangle-free graphs
Existence of six incomplete MOLS
On the independence number of (3, 3)-Ramsey graphs and the Folkman number F e (3, 3;4)
A census of one-factorizations of the complete 3-uniform hypergraph of order 9
A characterisation of cubic parity graphs
Generalized Steiner systems GS 5 (2, 5, v, 5)
Uncovered nodes and 3-cycles in tournaments
Spectra of Hadamard matrices
New infinite classes of 1-factorizations of complete graphs
The modular product and existential closure II
On undirected Cayley graphs
Congruences for Sheffer sequences
Bi-banded paths, a bijection and the Narayana numbers
A counterexample to a result on the tree graph of a graph
Who holds the best card? Secure communication of optimal secret bits
Convolution numbers
New D-optimal designs of order 110
On the switch-length of two connected graphs with the same degree sequence
5-valent symmetric graphs of order at most 100
Unimodality of the independence polynomials of non-regular caterpillars
Paley triple arrays
Maximum 2-independent sets of random cubic graphs
Improved upper bounds for the k-tuple domination number
Double domination stable graphs upon edge removal
Further results on the inducibility of $d$-ary trees
Some new families of simple t-designs
A note on Brooks' theorem for triangle-free graphs
The construction of four-weight spin models by using Hadamard matrices and M-structure
On various (strong) rainbow connection numbers of graphs
On k-total edge product cordial graphs
On upper bounds and connectivity of cages
Computational complexity of the negative decision number of graphs
Generalized Catalan numbers and the enumeration of planar embeddings
Mod sum graph labelling of H m, n and K n
Reducing the maximum degree of a graph by deleting vertices
Nonexistence of (3, 2, 1)-conjugate (v+7)-orthogonal Latin squares
Elation Laguerre planes of order p 2 that admit an automorphism group of order p 2 in the elation complement
A note on constructing digraphs with prescribed properties
Complexity of a {0, 1}-matrix problem
The nonexistence of distance-regular graphs with intersection arrays {27, 20, 10;1, 2, 18} and {36, 28, 4;1, 2, 24}
Antimagicness of some families of generalized graphs
Constructing designs using the union method
A new construction of self-dual codes from projective planes
Three-valued k-neighborhood domination in graphs
On maximal isolation sets in the uniform intersection matrix
A note on coloring of 3/3-power of subquartic graphs
On even [2, b]-factors in graphs
Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices
About vertex-critical non-bicolorable hypergraphs
Note on edge-colored graphs and digraphs without properly colored cycles
On Hamiltonicity of Cayley graphs of order $pqrs$
A non-planar version of Tutte's wheels theorem
Note on cubic symmetric graphs of order 2p n
Factor pair latin squares
Diameter of paired domination edge-critical graphs
On the non-existence of some generalized Hadamard matrices
The set splittability problem
Growth in products of graphs
Erdős-Ginzburg-Ziv type generalizations for linear equations and linear inequalities in three variables
Lower bound on the paired domination number of a tree
Some constructions for amicable orthogonal designs
Bounds on the arboricities of connected graphs
Variations of cops and robber on the hypercube
Product constructions for large sets of resolvable MTSs and DTSs
On the connectivity of the direct product of graphs
On the existence of three MOLS with equal-sized holes
Peg solitaire on trees with diameter four
Construction of bent functions from two known bent functions
On the Falk invariant of hyperplane arrangements attached to gain graphs
Decomposing graphs into forests of paths with size less than three
Note. An inequality for the line-size sum in a finite linear space
Disjoint Hamiltonian cycles in graphs
Online 3-choosability of a planar graph without certain cycles
Generators of matrix incidence algebras
A generalization of Fan-type conditions for Hamiltonian and Hamiltonian-connected graphs
Intersecting generalised permutations
A note on equimatchable graphs
Block-avoiding point sequencings of arbitrary length in Steiner triple systems
A class of full (d, 1)-colorable trees
On a conjecture of Hilton
On radial colorings of annuli
Using graph diameter for change detection in dynamic networks
Tree-Ramsey numbers
Signed total (j, k)-domatic numbers of graphs
Enhanced power graphs are weakly perfect
Decomposition of lambda-fold complete graphs into a certain five-vertex graph
Graceful graphs with pendant edges
Simple 3-designs with block size d+1 from PSL(2, 2 n ) where d|(2 n -1)
Degree distance and edge-connectivity
Valence-partitioned genus polynomials and their application to generalized dipoles
Full friendly index sets of cylinder graphs
Designs for graphs with six vertices and nine edges
Generalized Bhaskar Rao designs with two association classes
On the spectrum of the quasi-laplacian matrix of a graph
Exterior derivatives and Laplacians on digraphs
Directed packings with block size 5 and odd v
On the generalized (edge-)connectivity of graphs
Trees with extremal numbers of dominating sets
Bounds on the number of generalized partitions and some applications
G-designs of order n and index λ where G has 5 vertices or less
A construction of 3-existentially closed graphs using quadrances
Sums of squares and negative correlation for spanning forests of series parallel graphs
List backbone coloring of paths and cycles
Minimum cycle bases of product graphs
Deflatability of permutation classes
Finite groups with planar generating graph
Matching extensions of strongly regular graphs
The algorithmic complexity of certain functional variations of total domination in graphs
Efficient constructions for one sharing of many secrets
Set partitions as geometric words
Dihedral Golay sequences
On construction of weighing matrices by negacyclic matrices
On directed trades
Longest subsequences in permutations
Hadamard 2-groups with arbitrarily large derived length
Orientable and non-orientable maps with given automorphism groups
Some enumerations on non-decreasing Motzkin paths
MacWilliams identities for m-spotty weight enumerators of codes over rings
On restricted $r$-Stirling numbers, also known as $r$-Bessel numbers
On independent domination and size
Generalized ordered set partitions
The Frobenius problem on lattices
Approaching the mixed Moore bound for diameter two by Cayley graphs
Chords in graphs
Combinatorics and distributions of partial injections
Four-regular graphs that quadrangulate both the torus and the Klein bottle
Almost all graphs and h-hypergraphs have small diameter
A tight bound on the size of certain separating hash families
Helly-type problems for convex quadrilaterals in the plane
Blocking sets in handcuffed designs
Left-right arrangements, set partitions, and pattern avoidance
On the periodicity of graph games
The r-Fubini-Lah numbers and polynomials
Total k-subdominating functions on graphs
Stack-sorting for words
Note on k-contractible edges in k-connected graphs
Zigzag and foxtrot terraces for Z n
On radially maximal graphs
On the expected number of commutations in reduced words
On Ramsey unsaturated and saturated graphs
A short note regarding existence of complete sets of orthogonal diagonal Sudoku squares
The optimization of signed trees
On the cyclic decomposition of complete graphs into bipartite graphs
Back circulant Latin squares and the influence of a set
Connected bipancyclic isomorphic m-factorizations of the Cartesian product of graphs
Thoughts on Barnette's Conjecture
(3, λ)-group divisible covering designs
The chromatic index of block intersection graphs of Kirkman triple systems and cyclic Steiner triple systems
On existence of integral point sets and their diameter bounds
On distribution of Boolean functions with nonlinearity ≤2 n-2
Baxter tree-like tableaux
The watchman's walk of Steiner triple system block intersection graphs
The Erdős-Ko-Rado property for some permutation groups
On a problem of Froncek and Kubesa
Super-simple 2-(v, 5, 1) directed designs and their smallest defining sets
Equitable colourings in the Witt designs
The complexity of counting poset and permutation patterns
Families of 2-critical sets for dihedral groups
Orthogonal designs from negacyclic matrices
The number of classes of choice functions under permutation equivalence
Compounding secret sharing schemes
Optimal updating of ideal threshold schemes
Doubly near resolvable m-cycle systems
Some new results on small blocking semiovals
Interchanges and statistical designs
Path problems in dynamically orientable graphs
Hamilton decompositions of line graphs of perfectly 1-factorisable graphs of even degree
Radius-forcing sets in graphs
(g, f)-Chromatic spanning trees and forests
Kostka multiplicity one for multipartitions
Abstract hyperovals and Hadamard designs
Directed covering with block size 5 and v even
On 3 * -connected graphs
On edge-magic labelings of certain disjoint unions of graphs
On Ramsey-type games for graphs
A note on the connectivity of the Cartesian product of graphs
Graphs with a prescribed adjacency property
Concerning maximal arcs and inversive planes
Chromatic polynomials of some mixed hypergraphs
More R-sequenceable Groups
Drawing algorithms for planar st-graphs
Desargues, doily, dualities and exceptional isomorphisms
A different view of m-ary partitions
Minimum degree and the existence of semiregular factors in planar graphs
The nonclassical mixed domination Ramsey numbers
Graphs with Hamiltonian balls
Vertex-magic labeling of non-regular graphs