yusuke1997/dblp-id-title huggingface dataset:
Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs
On the existence of 4-chromatic subgraphs of G(ℚ 3 , d)
The integrity of small cage graphs
Almost resolvable minimum coverings of complete graphs with 4-cycles
Minus k-subdomination in graphs III
Applications of line geometry, III: The quadric Veronesean and the chords of a twisted cubic
On equidistance graphs
Prüfer codes for acyclic hypertrees
An f-chromatic spanning forest of edge-colored complete bipartite graphs
Two forbidden subgraphs and the existence of a 2-factor in graphs
Minimum 2-percolating sets in 2-connected, diameter 2 graphs
Improvements on inequalities for non-negative matrices
Applications of Narayana's formula
Restricted arc-connectivity of generalized tournaments
On the nonexistence of Hermitian circulant complex Hadamard matrices
Minimal graphs with prescribed vertex independence and clique numbers
Optimizing slightly triangulated graphs
Deficiencies of connected regular triangle free graphs
Contractors' minimum spanning tree
The measurements of closeness to graceful graphs
Trees with the same global domination number as their square
A degree condition for graphs to be fractional ID-[a, b]-factor-critical
Note on a closure concept and matching extension
Asteroidal-triple-free interval k-graphs
Factoring logic functions using star-colorings
On the delta sequence of the Thue-Morse sequence
Some new localization theorems on Hamiltonian properties
Disjoint and unfolding domination in graphs
Classification of coset-preserving skew-morphisms of finite cyclic groups
Covers in 5-uniform intersecting families with covering number three
A self-stabilizing distributed algorithm for edge-coloring general graphs
Extremal doubly even (56, 28, 12) codes and Hadamard matrices of order 28
Letter representations of n×n×p proper arrays
Chromaticity of the Complements of Some Sparse Graphs
The residually weakly primitive geometries of HS
On the total restrained domination number of a graph
Perfect k-domination in graphs
Another bridge between Nim and Wythoff
Regular clique covers of graphs
Sufficient conditions for n-matchable graphs
Destroying the Ramsey property by the removal of edges
Hurwitz-Radon inspired maximal three-dimensional real orthogonal designs
Nearly-acyclically pushable tournaments
Blocking sets in balanced path designs
On almost 1-extendable graphs
Multiplication of sequences with zero autocorrelation
The k th upper generalized exponent set for the class of non-symmetric primitive matrices
On minimally k-extendable graphs
Constructions of nested directed BIB designs
Hamiltonian connected balanced multipartite tournaments and hamiltonian connected partitions
The stipulation polynomial of a uniquely list-colorable graph
Maximum packings of K n with k-stars
Locating-domination, 2-domination and independence in trees
On the number of rainbow solutions of linear equations in ℤ/pℤ
Wiener index of generalized 4-stars and of their quadratic line graphs
Super edge-graceful labelings of complete bipartite graphs
Orthogonal designs of order 32 and 64 via computational algebra
A class of antiautomorphisms of Mendelsohn triple systems with two cycles
Some new constructions of orthogonal designs
Additive structure of difference sets and a theorem of Følner
Minimal critical sets for some small Latin squares
A note on distance domination numbers of graphs
Group divisible designs with block size five
Drawings of K n with the same rotation scheme are the same up to Reidemeister moves (Gioan's Theorem)
Nonagon quadruple systems: existence, balance, embeddings
On the distribution of coefficients of powers of positive polynomials
On the asymptotic existence of complex Williamson Hadamard matrices
Attacks and alignments: rooks, set partitions, and permutations
On Hamilton cycles and contractible edges in 3-connected graphs
Some notes about the odd area of unit discs centered at points on a circle
Minimally (k, k-1)-edge-connected graphs
G-designs, G-packings and G-coverings of λK v with a bipartite graph G of six vertices
Reconstruction of bipartite graphs and triangle-free graphs with connectivity two
Characterization of graphs with Hall index 2
Splitting balanced incomplete block designs
On Hamilton cycles in cubic (m, n)-metacirculant graphs, II
New results on the costs of Huffman trees
Daisy chains with three generators
Total Roman domination edge-supercritical and edge-removal-supercritical graphs
On defective colourings of complementary graphs
On permutation patterns with constrained gap sizes
Hexagon biquadrangle systems
On the radio number of toroidal grids
On the connectedness of 3-line graphs
Constructions of simple Mendelsohn designs
Unique minimum domination in trees
Group developed weighing matrices
Strong subtournaments of multipartite tournaments
Hadamard matrices constructed by circulant and negacyclic matrices
Lower bounds on the Münchhausen problem
Kathy Horadam: sixty
Plane triangulations without spanning 2-trees
Probabilistic aspects of r-Stirling numbers
A combinatorial solution to intertwined recurrences
Some new MOLS of order 2 n p for p a prime power
Antimagic and magic labelings in Cayley digraphs
Squaring the terms of an ℓ th order linear recurrence
An algebraic approach for finding balance index sets
Characterisations of intersection graphs by vertex orderings
Minimum tree decompositions with a given tree as a factor
A new lower bound for the harmonious chromatic number
Partitions with bounded differences between largest and smallest parts
On the total edge irregularity strength of zigzag graphs
On independent triples and vertex-disjoint chorded cycles in graphs
On the critical group of graph Möbius ladder
A note on terraces for abelian groups
Isomorphisms and classification of Cayley graphs of small valencies on finite Abelian groups
Repeated blocks in indecomposable twofold extended triple systems
On the computational complexity of upper distance fractional domination
On the fifth chromatic coefficient
Weakly 3-DCI abelian groups
Edge decompositions of hypercubes by paths
Construction of cubic homogeneous boolean bent functions
Path achievement games
Matching extension in toroidal quadrangulations II: the 3-extendable case
New multiple covering codes by tabu search
Perfect one-factorizations in line-graphs and planar graphs
A note on cycles of maximum length in bipartite digraphs
A note on the cyclic matching sequencibility of graphs
A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
A characterization of the planes meeting a hyperbolic quadric of $PG(3, q)$ in a conic
Construction of (γ, k)-critical graphs
On the number of connecting lines determined by n points in the real plane
On the intersection of three or four transversals of the back circulant latin squares
A characterization of group vertex magic trees of diameter up to 5
On potentially (K 4 -e)-graphic sequences
The intersection problem for a five vertex dragon
A minimum degree result for disjoint cycles and forests in bipartite graphs
Partition of a graph into cycles and isolated vertices
A construction of a class of graphs with depression three
An exposure property of block designs
On the number of indecomposable block designs
Projective planarity of matroids of 3-nets and biased graphs
An eccentric coloring of trees
Longest cycles in cyclically 4-edge-connected cubic planar graphs
The number of digraphs with small diameter
Total and connected domination in digraphs
On frame self-orthogonal Latin squares of type h m 1 n
On the star arboricity of hypercubes
In search of 4-(12, 6, 4) designs: Part III
A note on extending t-designs
The average connectivity of regular multipartite tournaments
Triangles in uniquely 3-colorable graphs on surfaces
Compatibly ordered Room squares
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs
New extremal ternary self-dual codes
Complementary cycles in regular multipartite tournaments
Smallest defining sets for 2-(9, 4, 3) and 3-(10, 5, 3) designs: Corrigendum
A note on the locating-total domination in trees
The damage number of a graph
Some new results on the integer-magic spectra of tessellation graphs
New linear codes over 𝔽 9
Constructing Hadamard matrices from orthogonal designs
A note on 4-regular distance magic graphs
Uniformly resolvable ℋ-designs with ℋ={P 3 , 4 }
A Fan-type condition for Hamiltonian graphs
The expected number of runs in a word
Groups of generalised projectivities in projective planes of odd order
On vertex-disjoint complete subgraphs of a graph
Some further results in Ramsey graph construction
Assorted musings on dimension-critical graphs
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
(M, S)-optimal designs with block size three
On 2-rainbow domination and Roman domination in graphs
Minimum weight spanning trees with bounded diameter
Some orthogonal matrices constructed by strong Kronecker multiplication
Locating-domination and identifying codes in trees
A note on the 2-domination number of a tree
Almost-$2$-regular random graphs
Pairwise balanced designs with block sizes 4 and 8
On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
Upper hamiltonian numbers and hamiltonian spectra of graphs
Generalized ballot sequences are ascent sequences
The graphs satisfying conditions of Ore's type
GDDs with two associate classes and with three groups of sizes 1, n and n
On properties of adjoint polynomials of graphs and their applications
On local matching property in groups and vector spaces
Bounds on the weak domination number
Almost regular c-partite tournaments with c ≥ 8 contain an n-cycle through a given arc for 4 ≤ n ≤ c
Polycyclic geometric realizations of the Gray configuration
On the list chromatic index of nearly bipartite multigraphs
Crossing numbers of sequences of graphs I: general tiles
Packing trees of bounded diameter into the complete graph
New classes of orthogonal designs constructed from complementary sequences with given spread
Characterization of quasi-symmetric designs with eigenvalues of their block graphs
P 2k -factorization of complete bipartite multigraphs
A computer search for complex Golay sequences
Completing partial latin squares: Cropper's question
Smallest defining sets for 2-(9, 4, 3) and 3-(10, 5, 3) designs
b-coloring of some bipartite graphs
On octonary codes and their covering radii
The construction of self-dual binary codes from projective planes of odd order
Fault-tolerant locating-dominating sets on the infinite tumbling block graph
Holey Schröder designs of type 4 n u 1
On the k-independence number in graphs
Equitable L(2, 1)-labelings of Sierpiński graphs
Weak edge Roman domination in graphs
Possible cardinalities for locating-dominating codes in graphs
C 4 -factorizations with two associate classes, λ 1 is odd
On an explicit correspondence between nbc -basis, chambers and minimal complex for real supersolvable arrangements
Covering a subset with two cycles
Matching extension in quadrangulations of the torus
Minimizing the weight of the union-closure of families of two-sets
Vertex magic total labeling of products of cycles
A trivalent graph of girth 17
Uniform coverings of 2-paths with 6-cycles in the complete graph
A local neighbourhood condition for n-extendable graphs
Complete k-ary trees and Hamming graphs
Spectral classes of hypergraphs
Cycles in 3-anti-circulant digraphs
On the number of even permutations with roots
New record graphs in the degree-diameter problem
A note on the Dembowksi-Prohaska conjecture for finite inversive planes
Subdivergence-free gluings of trees
Construction of magic rectangles of odd order
Hall spectra and extending precolorings with extra colors
The non-singularity of looped trees and complement of trees with diameter 5
The structure of strong tournaments containing exactly one out-arc pancyclic vertex
Regular vertex diameter critical graphs
Equitable edge coloured Steiner triple systems
Eternal domination on 3 × n grid graphs
6-Cycle decompositions of complete 3-uniform hypergraphs
About the structure of the blocker of the hyperplanes of a matroid
Light subgraphs of order 4 in large maps of minimum degree 5 on compact 2-manifolds
Weak king embeddings of oriented graphs
K 1, pq -factorization of complete bipartite graphs
Any tree is a large subgraph of a magic tree
Heuristics for sparse general travelling salesman problems
The total chromatic numbers of joins of sparse graphs
Hypercube packings and coverings with higher dimensional rooks
Proof of the Caccetta-Häggkvist conjecture for in-tournaments with respect to the minimum outdegree, and pancyclicity
On infinite families of sequences with one and two valued autocorrelation and two valued crosscorrelation function
On graphs having uniform size star factors
On graphs admitting t-ID codes
On the 2-edge-coloured chromatic number of grids
Self-converse Mendelsohn designs with block size 6q
The independent domination number of maximal triangle-free graphs
Transitive hyperovals in finite projective planes
Throttling zero force propagation speed on graphs
A tour problem on a toroidal board
On the construction of arcs using quadrics
On {K 4 , K 2, 2, 2 } ultrahomogeneity
Minimum sets of partial polyominoes
The number of s-separated k-sets in various circles
Remarks on Hadamard conjugation and combinatorial phylogenetics
Decompositions of complete tripartite graphs into cycles of lengths 3 and 6
Congestion-free routing of linear permutations on Fibonacci and Lucas cubes
Algebraic invariants arising from the chromatic polynomials of theta graphs
Unicyclic radially-maximal graphs on the minimum number of vertices
Fractional graphs
Bipieri tableaux
Genetic algorithms for orthogonal designs
Criticality indices of Roman domination of paths and cycles
On the punctured power graph of a finite group
Strict key avalanche criterion
Some sharply transitive partially ordered sets
Super (a, d)-edge antimagic total labelings of friendship graphs
On incomparable and uncomplemented families of sets
The metric chromatic number of a graph
On k-total dominating graphs
Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set
The triangle chromatic index of Steiner triple systems
A note on uniformly resolvable decompositions of K v and K v -I into 2-stars and 4-cycles
A note on the blocking sets in the large Mathieu design S(5, 8, 24)
Ovals in Desarguesian planes
The circular k-partite crossing number of K m, n
Counting connected sets and connected partitions of a graph
Engel quasigroups associated with cycle systems
On Boole's formula for factorials
On the number of tilings of the rectangular board with T-tetronimoes
Bounds on the domination number in oriented graphs
Biembedding Steiner triple systems and n-cycle systems on orientable surfaces
Resolvable modified group divisible designs with higher index
k-walks of graphs
Edge protection in graphs
Regular Hadamard matrix, maximum excess and SBIBD
A degree condition for the codiameter
The 3-connected graphs with a longest path containing precisely two contractible edges
The graphs of Hoffman-Singleton, Higman-Sims, McLaughlin and the Hermite curve of degree 6 in characteristic 5
A sufficient condition for Hamilton cycles in bipartite tournaments
The automorphism groups of the Laguerre near-planes of order four
A short proof for a theorem of Tutte
A geometric approach to orbital recognition in Chevalley-type coherent configurations and association schemes
Kernels in Cartesian products of digraphs
Edge proximity and matching extension in planar triangulations
On F-squares and their critical sets
Proof of Northshield's conjecture concerning an analogue of Stern's sequence for ℤ[√2]
On the complexity of strong and weak total domination in graphs
Trees, parking functions, and standard monomials of skeleton ideals
Seepage in directed acyclic graphs
Sufficient conditions for maximally edge-connected graphs and arc-connected digraphs
Corrigendum: The spectrum for 3-perfect 9-cycle systems
Diagonal entries of the average mixing matrix
All graphs with restrained domination number three less than their order
More mutually orthogonal Latin squares
A sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences
The tree- and clique-width of bipartite graphs in special classes
Securely computing XOR with 10 cards
The first BSTS with different upper and lower chromatic numbers
A remark on the Petersen coloring conjecture of Jaeger
Partitions according to multiplicities and part sizes
Pattern restricted quasi-Stirling permutations
Trees with domination subdivision number one
The groups A 7 , A 8 and a projective plane of order 16
Disjoint triangles and pentagons in a graph
Corrigendum to: A note on nearly platonic graphs
Star Edge coloring of the Cartesian product of graphs
A new method for constructing T-matrices
On degree conditions of semi-balanced 3-partite Hamiltonian graphs
Three-line chromatic indices of Steiner triple systems
Some Ramsey numbers for complete bipartite graphs
Intersecting integer partitions
On the number of m th roots of permutations
On ternary complementary pairs
Some results on incidence coloring, star arboricity and domination number
Bhaskar Rao ternary designs and applications
Color-induced subgraphs of Grünbaum colorings of triangulations
Lower bounds for rainbow Turan numbers of paths and other trees
Decompositions of complete multipartite graphs via generalized graceful labelings
On the largest minimal blocking set in PG(𝔽 8 )
List-edge-coloring triangulations with maximum degree at most five
Cryptographic Boolean functions via group Hadamard matrices
Cycle decompositions of the Cartesian product of cycles
A recursive theorem on matching extension
Enumeration of area-weighted Dyck paths with restricted height
Safe communication for card players by combinatorial designs for two-step protocols
4-restricted edge cuts of graphs
Elementary proofs of congruences for the cubic and overcubic partition functions
Anti-magic labellings of a class of planar graphs
On completing partial Latin squares with two filled rows and at least two filled columns
On the Steiner distance of trees from certain families
Stability of i-connectivity parameters under edge addition
A stack and pop stack in series
Embeddings of λ-fold kite systems, λ ≥ 2
A complete existence theory for Sarvate-Beam triple systems
Large sets of disjoint directed and Mendelsohn packing triple systems on 6k+5 points
Independence and global offensive alliance in graphs
Protected cells in bargraphs
The properties of self-complementary graphs and new lower bounds for diagonal Ramsey numbers
Further results on fine structures of three Latin squares
Regular digraphs of diameter 2 and maximum order
Some new weighing matrices using sequences with zero autocorrelation function
The domination number of the toroidal queens graph of size 3k×3k
The construction of subsquare free Latin squares by simulated annealing
Automorphisms of S 6 and the color cubes puzzle
Maximal sets of Hamilton cycles in complete multipartite graphs II
Magic labellings of infinite graphs over infinite groups
Total vertex irregularity strength of wheel related graphs
Zeros of adjoint polynomials of paths and cycles
Counting phylogenetic networks with few reticulation vertices: tree-child and normal networks
Bipanconnectivity of Cartesian product networks
Some strongly regular graphs with the parameters of Paley graphs
An enumeration of spherical latin bitrades
Examples of goal-minimally k-diametric graphs for some small values of k
On the average Wiener index of degree-restricted trees
Orthogonal resolutions of triple systems
Non Phelps codes of length 15 and rank 14
Packings and coverings of v=3m+1 points with near-triangle factors
Cyclic resolutions of the BIB design in PG(5, 2)
On random digraphs and cores
The vertex and edge graph reconstruction numbers of small graphs
Critical sets in orthogonal arrays with 7 and 9 levels
Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs
A new bound on the size of the largest 2-critical set in a latin square
Most switching classes with primitive automorphism groups contain graphs with trivial groups
On the perfect 1-factorisation problem for circulant graphs of degree 4
On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles
A series of Siamese twin designs intersecting in a BIBD and a PBD
Axiomization of the center function on trees
A secure additive protocol for card players
Fertility, strong fertility, and postorder Wilf equivalence
Quadratic excesses or paddings of covers with triples of λK n
On 2-(v, 3) trades of minimum volume
Doubly equivalent designs
Open neighborhood locating dominating sets
On the connectivity of extremal Ramsey graphs
Queens graphs for chessboards on the torus
Sets avoiding full-rank three-point patterns in $(\mathbb{F}_q^n)^k$ are exponentially small
Critical graphs with respect to total domination and connected domination
The complements of some covering designs and questions on the overall significance
There exists no symmetric configuration with 33 points and line size 6
Gallai-Ramsey numbers for graphs with five vertices and chromatic number four
More on sequences in groups
Jacobi-like sums and difference sets with Singer parameters
Total domination good vertices in graphs
Complementarity eigenvalues and graph determination
Permutations in which pairs of numbers are not simultaneously close in position and close in size
Relationships between the length of a longest path and the relative length
The star avoidance game
On the [32, 16, 8] BCH and quadratic residue codes
Circumferences of 3-connected tough graphs with large degree sums
A sufficient condition for the existence of a spanning Eulerian subgraph in 2-edge-connected graphs
Packing vector spaces into vector spaces
GBRDs with block size 3 over odd order groups and groups of orders divisible by 2 but not 4
Cubic leaves
Some orthogonal designs and complex Hadamard matrices by using two Hadamard matrices
C 4 -factorizations with two associate classes
Balanced sampling plans with block size four excluding contiguous units
Minimal dominating sets in maximum domatic partitions
A class of orthogonal latin square graphs
Fractals, recursions, divisibility
On the number of even roots of permutations
n-extendability of line graphs, power graphs, and total graphs
Switching m-edge-coloured graphs using non-abelian groups
Spectra and cuts
Hall's condition yields less for multicolorings
A neighborhood and degree condition for pancyclicity and vertex pancyclicity
Modified Padovan words and the maximum number of runs in a word
On ρ-labeling the union of three cycles
231-Avoiding involutions and Fibonacci numbers
Triple systems for identifying quadruples
Groups with right-invariant multiorders
Note on competition and phylogeny numbers
A time-constrained variation of the Watchman's Walk problem
The binding number of a random graph
Complete equipartite 3p-cycle systems
Total acquisition on grids
Pairs of simple balanced ternary designs with prescribed numbers of triples in common
Egge triples and unbalanced Wilf equivalence
Domination number of the directed cylinder
Graphs that have separator tree representations
Simpler methods for generating better Boolean functions with good cryptographic properties
Half-regular symmetric designs
A directed version of Deza graphs - Deza digraphs
On set colorings of complete bipartite graphs
Semiregular group divisible designs whose duals are semiregular
Packings in enneads
A generalization of a result of Segre on permutable polarities
A small embedding for partial directed 6k-cycle systems
On (minimal) regular graphs of girth 6
A census of 2-(9, 3, 3) designs
On $r$-equichromatic lines with few points in $C^2$
Signed double Roman k-domination in graphs
On maximal (k, b)-linear-free sets of integers and its spectrum
On P -unique hypergraphs
The spectrum of rotational directed triple systems and rotational Mendelsohn triple systems
The characterization of edge-maximal critically k-edge connected graphs
On the defining sets of some special graphs
Reciprocals of thinned exponential series
Graphs with disjoint $2$-dominating sets