yusuke1997/dblp-id-title huggingface dataset:
Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs
A note on quasi-symmetric designs
Skolem labelled trees and P s □P t Cartesian products
A note on partial list coloring
A lower bound for the size of a critical set in the back circulant latin square
On decomposing complete tripartite graphs into 5-cycles
The k-proper index of complete bipartite and complete multipartite graphs
An explicit formula for the inverse of a factorial Hankel matrix
Hamiltonicity in directed Toeplitz graphs T n 〈1,2;t 1 ,t 2 〉
2-Domination edge subdivision in trees
On the Ramsey number for stars versus connected graphs of order six
Strongly amicable orthogonal designs and amicable Hadamard matrices
Strongly cospectral vertices
On the Wiener index of trees from certain families
Primitive sets in a lattice
A bound on the order of a graph when both the graph and its complement are contraction-critically k-connected
A partial K 4 -e-design of order n can be embedded in a K 4 -e-design of order at most 8n+16√n+82
Packing four copies of a tree into a complete graph
Voloshin's conjecture for C-perfect hypertrees
The second largest eigenvalue of trees
Partitions into three triangular numbers
Edge-face chromatic number of plane graphs with high maximum degree
Extendability of the complementary prism of bipartite graphs
Cyclically closed pattern classes of permutations
A degree condition for the existence of connected factors
Diffusion: quiescence and perturbation
Covalence sequences of transitive plane tessellations and transitive maps on surfaces
Extreme tournaments with given primitive exponents
New families of graphs whose independence polynomials have only real roots
Characterisation and classification of signatures of spanning trees of the n-cube
A combinatorial bound on the number of distinct eigenvalues of a graph
On the dimension of downsets of integer partitions and compositions
Finite Euclidean graphs over ℤ 2 r are non-Ramanujan
A note on signed and minus domination in graphs
The Friedlander-Gordon-Miller conjecture is true
On a conjecture of Merrifield and Simmons
A set partition number system
Well-indumatched trees and graphs of bounded girth
On the existence of (v, k, t) trades
On comparability of bigrassmannian permutations
Bhaskar Rao designs and the alternating group A 4
Gray codes for set partitions and restricted growth tails
Perfect $1$-factorisations of complete $k$-uniform hypergraphs
Faithful extension on finite order classes
Further results on proper and strong set colorings of graphs
Classroom note: An easy bijective proof of the matrix-forest theorem
On several classes of monographs
Broadcast domination in graph products of paths
A theory of 2-dipath colourings
Optimal orientations of vertex-multiplications of Cartesian products of graphs
The maximum order of a strong matching in a random graph
A note on balanced independent sets in the cube
Krein covers of complete graphs
Degree conditions for the existence of [k, k+1]-factors containing a given Hamiltonian cycle
On 2-perfect cube decompositions
An invariant for minimum triangle-free graphs
The second neighborhood conjecture for oriented graphs missing $\{C_4, \overline{C}_4, S_3, \text{chair and co-chair}\}$-free graph
Independent [1, k]-sets in graphs
On some finite linear spaces with few lines
The number of 8-cycles in 2-factorizations of K n
Semi-planar Steiner quasigroups of cardinality 3n
The fine structure of threefold directed triple systems
On the order of almost regular graphs without a matching of given size
How to construct a block design with block size four admitting a blocking set
On the maximal number of vertices covered by disjoint cycles
Disjoint cycles of order at least 5
Geodetic number of random graphs of diameter 2
Labeled packings of graphs
On colorings and orientations of signed graphs II
Difference sets and power residues
On 2- and 3-factorizations of complete 3-uniform hypergraphs of order up to 9
On the cyclic decomposition of circulant graphs into bipartite graphs
A computer study of some 1-error correcting perfect binary codes
On Laplacian monopoles
Double-crossed chords and distance-hereditary graphs
Recursive formulas for embedding distributions of cubic outerplanar graphs
Two-stack-sorting with pop stacks
Set-valued Young tableaux and product-coproduct prographs
Some interesting constructions for secret sharing schemes
A combinatorial generalisation of the Jordan curve theorem
Strong compatibly ordered OGDD of type h n for n=6k+1
A note on the minimum degree of minimal Ramsey graphs
New orthogonal designs from weighing matrices
On deformed dodecahedron tiling
Note on equitable colorings of graphs
On the bigenus of the complete graphs
On the ubiquity and utility of cyclic schemes
Restricted 132-Dumont permutations
RAK factoring algorithm
Generating functions for descents over permutations which avoid sets of consecutive patterns
Coincidence among families of mesh patterns
Vertex identifying codes for the n-dimensional lattice
Subgraph-avoiding minimum decycling sets and k-conversion sets in graphs
Some new results for the queens domination problem
Foldings and meanders
A single axiom for semi-Boolean SQS-skeins
On crystal sets
Further results on ternary complementary sequences, orthogonal designs and weighing matrices
On counting n-element trellises having exactly one pair of noncomparable elements
Kernel operators and improved inclusion-exclusion bounds
Applications of finite geometries to information security
Toroidal boards and code covering
Matching designs
Edge precoloring extension of trees
Icosahedron designs
Extensions of α-polynomial classes
Reversible cyclic codes over Z 4
The μ-way intersection problem for cubes
Various super-simple designs with block size four
Packing a forest with a graph
On graphs and codes associated to the sporadic simple groups HS and M 22
Uniform star-factors of graphs with girth three
Impartial achievement games for generating generalized dihedral groups
More greedy defining sets in Latin squares
On the principal edge bipartition of a graph
Algorithmic aspects of integral designs
Zagreb indices of maximal $k$-degenerate graphs
The negative decision number in graphs
Black box analysis of stream ciphers
Construction of new larger (a, d)-edge antimagic vertex graphs by using adjacency matrices
Partial S(k-1, k, v)'s inducing P k -decompositions of K v
The smallest 3-uniform bi-hypergraph which is a realization of a given vector
On Kleinewillinghöfer types of finite Laguerre planes with respect to homotheties
A note on bootstrap percolation thresholds in plane tilings using regular polygons
On covering designs with block size 5 and index 11≤λ≤21: the case v≡0(mod 4)
The intersection problem for graphs with six vertices, six edges and a 4-cycle subgraph
Perfect domination in regular grid graphs
Sufficient conditions for a graph to be k -edge-hamiltonian, k -path-coverable, traceable and Hamilton-connected
A combinatorial generalization of Wilson's theorem
On the number of nonseparating vertices in strongly connected in-tournaments
On the cyclotomic identity and related product expansions
Feasible sets of small bicolorable STSs
Ternary codes through ternary designs
A classification of Laguerre near-planes of order four
On the maximum out-degree in random trees
A colour-sliding problem on graphs
Group distance magic labeling of some cycle-related graphs
Wilf-collapse in permutation classes having two basis elements of size three
Bad drawings of small complete graphs
The left cells with a-values 5, 6 in the affine Weyl group ~E 8
Deficiencies of r-regular k-edge-connected graphs
Equitable partial cycle systems
New skew-Hadamard matrices via computational algebra
New families of strongly regular graphs
Colored multipermutations and a combinatorial generalization of Worpitzky's identity
Identical twin Steiner triple systems
Magic labellings of infinite graphs
Paths and cycles in colored graphs
Global offensive alliance numbers in graphs with emphasis on trees
Some new D-optimal designs
DIII clan combinatorics for the orthogonal Grassmannian
Perfect domination
Intersection numbers of Latin squares with their own orthogonal mates
The edge domination number of connected graphs
Cycle packings of the complete multigraph
Double Dudeney sets for an odd number of vertices
On rainbow cycles in edge colored complete graphs
Applying Skolem sequences to gracefully label new families of triangular windmills
A class of trees with equal broadcast and domination numbers
Irregular edge-colorings of sums of cycles of even lengths
On the combinatorics of quadrant marked mesh patterns in 132-avoiding permutations
Combinatorics of JENGA
Decompositions of λK v into k-circuits with one chord
The centre of a sloop
Constructing a large class of supertough graphs
New infinite families of Williamson Hadamard matrices
Symmetric alternating sign matrices
Density version of the Ramsey problem and the directed Ramsey problem
On f-factors in claw-free graphs
On a question of Li concerning an uncounted class of circular permutations
The neighbourhood polynomial of a graph
On increasing and invariant parking sequences
Basic retracts and counting of lattices
Minkowski tangent-circle structures and key distribution patterns
Faces of directed edge polytopes
Two-factorisations of complete graphs of orders fifteen and seventeen
On the differences of the independence, domination and irredundance parameters of a graph
Bipartite graphs with even spanning trees
Some V(12, t) vectors and designs from difference and quasi-difference matrices
Minimum coverings of K n with hexagons
The energy of the Mycielskian of a regular graph
Distance domination and amplifier placement problems
Parikh-friendly permutations and uniformly parikh-friendly words
The r -matching sequencibility of complete multi- k -partite k -graphs
Stirling numbers of the second kind and Bell numbers for graphs
Note on the normalized Laplacian eigenvalues of signed graphs
Intersection graphs of oriented hypergraphs and their matrices
Critical sets in a family of groups
An upper bound of the basis number of the lexicographic product of graphs
Design spectra for 6-regular graphs with 12 vertices
Small non-isomorphic repeated measurements designs
On shifted intersecting families with respect to posets
A new small embedding for partial 8-cycle systems
Balanced independent sets in hypercubes
List proper connection of 2-edge-connected graphs
Some enumerative combinatorics arising from a problem on quadratic nonresidues
Inflection points of coherent reliability polynomials
Superthrackles
Exponents of primitive graphs
Bigraph-factorization of symmetric complete bipartite multi-digraphs
Maximal local edge-connectivity of diamond-free graphs
Cyclic matching sequencibility of graphs
The Firefighter Problem: a survey of results, directions and questions
Representing graphs in Steiner triple systems - II
Order unicyclic mixed graphs by spectral radius
The integer-magic spectra and null sets of the Cartesian product of trees
A conjecture on Gallai-Ramsey numbers of even cycles and paths
A dominating pair condition for a balanced bipartite digraph to be hamiltonian
Counting families of generalized balancing numbers
Partitions of the edge set of a graph into internally disjoint paths
Modified group divisible designs with block size 4 and λ>1
A note on the Turán number of a Berge odd cycle
On the Ramsey number R(C n or K n-1 , K m ) (m=3, 4)
Covering regular graphs with forests of small trees
On locating-dominating codes for locating large numbers of vertices in the infinite king grid
The average degree in a vertex-magic graph
Generalized relative difference sets and PBIBDs associated with amorphous association schemes over an extension ring of Z/4Z
Dyck paths and partial Bell polynomials
Minimal completely separating systems of sets
The induced path number of the cartesian product of some graphs
Nested balanced ternary designs and Bhaskar Rao designs
Towards the spectrum of critical sets
A characterization of well covered block-cactus graphs
A heuristic for the feedback arc set problem
Long cycles through specified edges and vertices
Maximising common fixtures in a round robin tournament with two divisions
On contractible edges in 3-connected graphs
The crossing number of C 6 × C n
A characterization of domination 4-relative-critical graphs of diameter 5
On construction of non-normal Boolean functions
Erratum to 2-walks in 3-connected planar graphs
Graphs with equidistant central nodes
Vertex-disjoint cycles containing specified edges in a bipartite graph
Classification of trivalent symmetric graphs of small order
Forbidden families of configurations
On (a, d)-distance antimagic graphs
On cubic and edge-critical isometric subgraphs of hypercubes
A generalized switching method for combinatorial estimation
Partitioning sets of oriented triples into the smallest nontrivial oriented triple systems
Closing a gap in the spectrum of critical sets
On connected k-domination in graphs
Edge-reconstruction of the decay number of a connected graph
On critically k-extendable graphs
A theorem about vectors in $\mathbb{R}^2$ and an algebraic proof of a conjecture of Erdős and Purdy
Integral trees with diameters 4, 6 and 8
Feedback numbers of Kautz undirected graphs
Ralph Gordon Stanton
A note on the independence number in bipartite graphs
A new approach for enumerating maps on orientable surfaces
Landau's Theorem revisited
Constructions for Hadamard matrices, Clifford algebras, and their relation to amicability / anti-amicability graphs
Covering a bipartite graph with cycles passing through given edges
Zero forcing, tree width, and graph coloring
Finite Möbius near-planes
A note on signed k-submatching in graphs
Edge contraction and cop-win critical graphs
A survey of graphs with known or bounded crossing numbers
Convergence laws for random words
Edge-fault-tolerant properties of hypercubes and folded hypercubes
Uniform generalized Steinhaus graphs
On generalized weights for codes over ℤ k
On the treewidth of generalized Kneser graphs
Decycling regular graphs
Orthogonal 3-GDDs with four groups
Embedding quartic Eulerian digraphs on the plane
Bounds on the fair total domination number in trees and unicyclic graphs
A characterization of the set of lines either external to or secant to an ovoid in PG(3, q)
Nice lists of differences, and their connections with algebraic properties of unitary polynomials
An introduction to true palindromic compositions
Bicritical total domination
Changing and unchanging acyclic domination: edge addition
Gracefulness of a cycle with parallel P k -chords
On graphs having a unique minimum independent dominating set
Efficient algorithms for reliability of a consecutive 2-out-of-r-from-n: F system
Path decomposition of defect 1-extendable bipartite graphs
Edge homogeneous embeddings of cycles in graphs
On the decomposition of Cayley graphs into isomorphic trees
Single change neighbor designs
Peg solitaire on the windmill and the double star graphs
The total vertex irregularity strength of generalized helm graphs and prisms with outer pendant edges
Biembeddings of Latin squares obtained from a voltage construction
The intersection problem for small G-designs
4-homogeneous latin trades
Toroidal queens graphs over finite fields
Corrigendum to: On a {K 4 , K 2, 2, 2 }-ultrahomogeneous graph
On ℤ-flow-continuous maps and oriented colorings of cubic graphs
Rainbow numbers for the generalized Schur equation $x_1 + x_2 + ... +x_{m-1} = x_m$
A generalization of the Erdős-Ko-Rado Theorem
Strongly square-free strings on three letters
The existence of (1,m)-near-Skolem sequences
Further results on the existence of generalized Steiner triple systems with group size g≡1, 5(mod 6)
On extremal trees with respect to their terminal distance spectral radius
C 5 -decompositions of the tensor product of complete graphs
On the achromatic number of the Cartesian product G 1 ×G 2
Constructing $(3, b)$-Sudoku pair Latin squares
Upper bounds on the k-tuple domination number and k-tuple total domination number of a graph
Digraphs of finite linear transformations
Defining sets of G-designs
Note on the bondage number of graphs on topological surfaces
Forbidden pairs combinatorics
Coloring k-trees with forbidden monochrome or rainbow triangles
Asymptotic enumeration of Eulerian digraphs with multiple edges
Approximating Vizing's independence number conjecture
Irredundance saturation number of a graph
On the spectrum of minimal covers by triples
Intersecting families, signed sets, and injection
Maximum matchings in 3-connected graphs contain contractible edges
Stirling permutations containing a single pattern of length three
Skew throttling
On free products of graphs
Near α-labelings of bipartite graphs
On binary codes related to mutually quasi-unbiased weighing matrices
Integral point sets over finite fields
The diameter of lifted digraphs
On an algorithm for comparing the chromatic symmetric functions of trees
On strongly edge-critical graphs of given diameter
Concentric Bilinski diagrams
Equivalence classes of n-dimensional proper Hadamard matrices
Unique colorings of bi-hypergraphs
On the existence of vertex critical regular graphs of given diameter
Random correlation matrices
Multidesigns of the λ-fold complete graph for graph-pairs of orders 4 and 5
Throttling for standard zero forcing on directed graphs
In search of 4-(12, 6, 4) designs: Part II
Characterization of induced matching extendable graphs with 2n vertices and 3n-1 edges
Locating-dominating codes in cycles
Greedy defining sets of graphs
Properties of independent Roman domination in graphs
Palettes in block colourings of designs
On the meanness of arbitrary path super subdivision of paths
On the spectra of the fullerenes that contain a nontrivial cyclic-5-cutset
King's walk on the infinite chessboard
Decompositions of complete tripartite graphs into k-cycles
On the existence of partitioned incomplete Latin squares with five parts
Q-analogues of convolutions of Fibonacci numbers
Some results on 2-homogeneous graphs
Spectral measures of balance for signed graphs
Notes on the structure of support in BIB designs
Largest 6-regular toroidal graphs for a given diameter
Completing some spectra for 2-perfect cycle systems
Forbidden substrings on weighted alphabets
On the number of nonseparating vertices in strongly connected local tournaments
On a conjecture on k-walks of graphs
On the structure of graphs having a unique k-factor
The Gale-Ryser theorem modulo k
Quasi-symmetric 3-designs with a fixed block intersection number
A note on finding a maximum clique in a graph using BDDs
A new presentation for the inner Tutte group of a matroid
Extending Skolem sequences, how can you begin?
Lower bounds for the minimum diameter of integral point sets
Extremal problems for local properties of graphs
Global forcing number of grid graphs
On Hamilton cycles in cubic (m, n)-metacirculant graphs
Equitable induced decompositions of twin graphs
Triangular Cayley maps of K n, n, n
1-identifying codes on trees
A lexicographic product for signed graphs
Avoiding rainbow induced subgraphs in edge-colorings
A group induced four-circulant construction for self-dual codes and new extremal binary self-dual codes
On the paper "Association schemes for diagonal groups"
The minimal polynomial of 2cos(π/p) and its application to regular maps of large planar width
On the edge-reconstruction number of a tree
BLT-sets over small fields
Digraph covering and its application to two optimization problems
A cycle decomposition conjecture for Eulerian graphs
A characterization of k-trees that are interval p-graphs
On row-column directed block designs
Rainbow cycles versus rainbow paths
Construction of amicable orthogonal design
New lower bounds of ten classical Ramsey numbers
Estimates on strict Hall exponents
On finite graphs that are self-complementary and vertex transitive
On mirror nodes in graphs without long induced paths
2-walks in 3-connected planar graphs
Decycling of Fibonacci cubes
Orthogonal double covers of complete bipartite graphs by the union of a cycle and a star
The strong edge colorings of a sparse random graph
On the partition function of a finite set
A characterisation of P n, q among the symmetric designs using elations
On sufficient conditions for some orthogonal designs and sequences with zero autocorrelation function
Generating functions for purely crossing partitions
On potentially P-graphic degree sequences
Characterizations of various matching extensions in graphs
Maximum graphs with unique minimum dominating set of size two
Ortho-radial drawings of graphs
Revisiting the spread and covering numbers
Optimal holey packing OHP 4 (2, 4, v, 2) for v≡2 (mod 3)
On connected resolvability of graphs
Semi-evenly partite star-factorization of symmetric complete tripartite digraphs
A criterion for some Hamiltonian graphs to be Hamilton-connected
A counterexample for Hilton-Johnson's conjecture on list coloring of graphs
New bounds for pairwise orthogonal diagonal Latin squares
New D-optimal designs via cyclotomy and generalised cyclotomy
On Merrifield-Simmons index of unicyclic graphs with given girth and prescribed pendent vertices
A structural method for Hamiltonian graphs
The signed Roman k-domatic number of digraphs
Decompositions of complete multipartite graphs into selfcomplementary factors with finite diameters
Strong weakly connected domination subdivisible graphs
Spherical and planar folding tessellations by kites and equilateral triangles
Existence of 3-factors in K 1, n -free graphs with connectivity and edge-connectivity conditions
Diagonally switchable 4-cycle systems revisited
On an inverse Cayley problem
On large cycles with lengths differing by one or two
Short witnesses for Parikh-friendly permutations
A class of k-caps having k-2 points in common with an elliptic quadric and two points on an external line
A note on packing spanning trees in graphs and bases in matroids
On the size of odd order graphs with no almost perfect matching
Automorphism groups and adversarial vertex deletions
Column expansion identities and quadratic spanning forest identities
On 2-edge robust r-identifying codes in the king grid
An index-preserving bijection between marked tableaux and P n,2 -tableaux
On the Ramsey number R(3, 6)
The metric dimension of the incidence graphs of projective planes of small order
Construction for an OGDD of type 24 4
Optimal pebbling in products of graphs
Triangles in contraction critical 5-connected graphs
The maximum degree in a vertex-magic graph
Compositions of pattern restricted sets of permutations
A note on completing latin squares
A note on full transversals and mixed orthogonal arrays
Existence of almost resolvable directed 5-cycle systems
An extremal problem related to biplanes
Positive binary labelling of graphs
The asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edges
The number of h-strongly connected digraphs with small diameter
Irregular total labeling of disjoint union of prisms and cycles
Ultimately bipartite subtraction games
Hypergraceful complete graphs
Finding monarchs for excluded minor classes of matroids
Degree diameter problem on triangular networks
The existence of (v, 4, λ) disjoint difference families
The sigma-sequence and counting occurrences of some patterns, subsequences and subwords
Roman domination in complementary prisms
$(27, 6, 5)$ designs with a nice automorphism group
Cycles containing a set of elements in cubic graphs
The classification of combinatorial surfaces using 3-graphs
Generalised Bhaskar Rao designs with elements from cyclic groups of even order
Existence of doubly near resolvable (v, 4, 3) BIBDs
On minimum possible volumes of strong Steiner trades
A counterexample to a conjecture of Jackson and Wormald
On a variation of the Randíc index
Magic rectangle sets of odd order
The triangle intersection problem for nested Steiner triple systems
Some generalizations of extension theorems for linear codes over finite fields
An inverse problem for the collapsing sum
List strong edge coloring of some classes of graphs
Choosability of the square of a planar graph with maximum degree four
Maximum packings of K n with hexagons
Edge growth in graph powers