yusuke1997/dblp-id-title huggingface dataset:
P 3 -factorization of complete bipartite symmetric digraphs
Oriented threshold graphs
Cycles and paths in multigraphs
On regular (1, q)-extendable graphs
Group divisible designs GDD(n, n, n, 1; λ 1 , λ 2 )
Cosets, voltages, and derived embeddings
Monogamous decompositions of complete bipartite graphs, symmetric H-squares, and self-orthogonal 1-factorizations
An extension of the Corrádi-Hajnal Theorem
On removable series classes in connected matroids
The Twelfth International Conference on Permutation Patterns, 2014
Orphan complexes of neighborhood anti-Sperner graphs
The number of $4$-cycles and the cyclomatic number of a finite simple graph
Corrigendum: Trees and n-good hypergraphs
Sufficient conditions for graphs to be maximally 4-restricted edge connected
Two-fold automorphisms of graphs
Pairwise balanced designs of dimension three
Linear dependencies in product ciphers
On the diameter of domination bicritical graphs
Searching for quicksand ideals in partially ordered sets
Quest for graphs of Frank number 3
The transformation graph G ++-
Ternary designs with the maximum or near maximum number of replication numbers
Radius $r$ extremal graphs of girth 5
Existence of (K 4 -e)-GDDs of type 2 n
On minimal symmetric automorphism groups of finite symmetric graphs
Some equitably 2 and 3-colourable cube decompositions
A neighbourhood union condition for pancyclicity
A characterisation of eccentric sequences of maximal outerplanar graphs
Counting labeled threshold graphs with Eulerian numbers
ERRATUM to: Double domination edge removal critical graphs
On the spectrum of nested G-designs, where G has four non-isolated vertices or less
The defining numbers for vertex colorings of certain graphs
Multiplications of ternary complementary pairs
Smallest defining sets of designs associated with PG(d, 2)
Weighted Ramsey problem
Hamiltonian cycles avoiding sets of edges in a graph
Kirkman years in PG(3, 2)
Hamilton decompositions of complete bipartite graphs with a 3-factor leave
Upper and lower bounds on the size of $B_{k}[g]$ sets
On the colorability of graphs decomposable into degenerate graphs with specified degeneracy
How many non-isospectral integral circulant graphs are there?
Graphs derived from perfect difference sets
Matching generalized nested sets
Uniform shared neighborhood structures in edge-regular graphs
More trees with equal broadcast and domination numbers
A counter-example to Voloshin's hypergraph co-perfectness conjecture
Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs
Core partitions with d-distinct parts
Identifying flaws in the security of critical sets in latin squares via triangulations
Bijections for restricted inversion sequences and permutations with fixed points
Thwart numbers of some bipartite graphs
Classification of simple 2-(6, 3) and 2-(7, 3) trades
Extraconnectivity of hypercubes (II)
On the sizes of the graphs G, G r , G r \ G: the directed case
A combined approach to the construction of Hadamard matrices
The equivalence of certain auto-correlated quaternary and binary arrays
A q-queens problem VII: Combinatorial types of nonattacking chess riders
Overlapping factors in words
Leaves, excesses and neighbourhoods in triple systems
Anti-van der Waerden numbers of graph products of cycles
Convex invariants in multipartite tournaments
Arc- and circle-visibility graphs
Indices of convergence on four digraph operators
The diameter of total domination and independent domination vertex-critical graphs
The algorithmic complexity of signed domination in graphs
On ℤ 4 codes satisfying the chain condition
Small snarks and 6-chromatic triangulations on the Klein bottle
A lower bound for the depression of trees
A note on balanced (q, {3, 4}, λ)-DFs with q a prime power
The matching property of nested sets
Linear codes and weights
Orthogonal diagonal sudoku solutions: an approach via linearity
On 2-dominating kernels in graphs
Graphs whose crossing numbers are the same as those of their line graphs
Hamilton cycle decompositions of k-uniform k-partite hypergraphs
Generalized Ramsey theorems for r-uniform hypergraphs
Symmetrically inequivalent partitions of a square array: part II
Switching for small strongly regular graphs
(k+1)-line graphs of k-trees
Weak and strong nestings of BIBDs
On conjectures on the defining set of (vertex) graph colourings
A small embedding for partial hexagon systems
A classification of symmetric graphs of order 30
Indecomposable Skolem and Rosa sequences
Set-valued tableaux and generalized Catalan numbers
Partition identities arising from involutions
A note on strong edge choosability of toroidal subcubic graphs
Genus distributions of orientable embeddings for two types of graphs
Domination critical graphs with respect to relative complements
Labelled Cayley graphs and minimal automata
Partitions of ℤ m with the same representation functions
Noncrossing partitions with fixed points
Some structural results on linear arboricity
On the construction of n-dimensional designs from 2-dimensional designs
Asymptotic estimates for the number of permutations without short cycles
A note on the construction of GH(4tq, EA(q)) for t=1, 2
Some operations of graphs that preserve the property of well-covered by monochromatic paths
The amicable-Kronecker construction of quaternion orthogonal designs
Unimodality of some independence polynomials via their palindromicity
Characterizing block graphs in terms of their vertex-induced partitions
Large non-trivial $t$-intersecting families of signed sets
Degree associated reconstruction number of connected digraphs with unique end vertex
On amicable orthogonal designs of order 8
Optimal point sets determining few distinct angles
Minimal bases for the laws of certain cycle systems
Pan-orientable block designs
In search of 4-(12, 6, 4) designs: Part I
Factorisation of semiregular relative difference sets
On the spectrum of the closed-set lattice of a graph
On the Hamilton-Waterloo problem with triangle factors and C 3x -factors
On the packing coloring of undirected and oriented generalized theta graphs
The minimum number of detours in graphs
Fractional and circular 1-defective colorings of outerplanar graphs
The genus distributions of 4-regular digraphs
The complete multigraphs and their decompositions into open trails
Paths, cycles and wheels in graphs without antitriangles
On digraphs with unique walks of closed lengths between vertices
On the spectrum of an F-square
Nested colorings of graphs
Finite and infinite hypercubes as direct products
Bounds on the number of Γ-operation edge substitutions required to transform a maximal planar graph into another
The asymptotic existence of orthogonal designs
Systems of mutually unbiased Hadamard matrices containing real and complex matrices
On the independence polynomials of path-like graphs
Note on three-character (q+1)-sets in PG(3, q)
Cayley maps with given exponents and distribution of inverses
On the directed triple systems with a given automorphism
On the Plotkin arrays
The minimal size of a graph with generalized connectivity κ 3 = 2
Some infinite classes of Williamson matrices and weighing matrices
Minimum cycle bases of direct products of bipartite graphs
On automorphisms of Cayley graphs, and irregular groups
A note on the cycle index polynomial of the symmetric group
Minimal defining sets in a family of Steiner triple systems
A study of hendecads
An extremal problem on rainbow spanning trees in graphs
Dominance in a Cayley digraph and in its reverse
A note on BIB designs with nested rows and columns
Addendum: Minimum weight spanning trees with bounded diameter
Boolean complexes for Ferrers graphs
Tournaments and the Erdős-Hajnal conjecture
Congruences modulo high powers of 2 for Sloane's box stacking function
Lower bound on the weakly connected domination number of a cycle-disjoint graph
Vertex disjoint cycles in a directed graph
Semi-regular sets of matrices and applications
Cycles in quasi 4-connected graphs
Variations on the McFarland and Spence constructions of difference sets
Characterize graphs with rainbow connection numbers m-2 and m-3
Pancyclicity of 4-connected claw-free net-free graphs
Combinatorial aspects of C.A.R. Hoare's FIND algorithm
Double domination edge removal critical graphs
The parameters 4-(12, 6, 6) and related t-designs
Decompositions of K m, n and K n into cubes
Linear blocking sets in PG(2, q 4 )
On extending the Bose construction for triple systems to decompositions of complete multipartite graphs into 2-regular graphs of odd order
On split and almost CIS-graphs
Generalized path pairs and Fuss-Catalan triangles
A combinatorial characterization of the Hermitian surface
On round-robin tournaments with a unique maximum score
On constructing graphs with a prescribed adjacency property
Geometric and combinatorial structure of a class of spherical folding tesselations - II
Enumeration of tilings of a hexagon with a maximal staircase and a unit triangle removed
Supplementary difference sets constructed from (q+1)st cyclotomic classes in GF(q 2 )
Determining properties of a multipartite tournament from its lattice of convex subsets
Automorphisms of groups and isomorphisms of Cayley digraphs
Independence and matchings in σ-hypergraphs
Connectivity of local tournaments
More on embedding partial totally symmetric quasigroups
A note on potentially K 1, 1, t -graphic sequences
A neighborhood and degree condition for panconnectivity
Optimal 1-planar graphs which quadrangulate other surfaces
Some results on decompositions of low degree circulant graphs
Signed total domination on Kronecker products of two complete graphs
Spectra of hyperstars
Computational methods and new results for chessboard problems
Erratum to the article 'A lexicographic product for signed graphs'
On the Vamos matroid, homogeneous pregeometries and dense pairs
Lower bounds for the Laplacian spectral radius of an oriented hypergraph
Genus distribution of graph amalgamations: self-pasting at root-vertices
Excluded minors for the class of split matroids
Minimal defining sets for full 2-(v, 3, v-2) designs
Orthogonal double covers of complete graphs by certain spanning subgraphs
Automorphism groups and isomorphisms of Cayley digraphs of Abelian groups
On isomorphisms of Cayley digraphs on dihedral groups
A matrix approach to construct magic rectangles of even order
Betti numbers of subgraphs
Generalized Pell numbers, graph representations and independent sets
A note on decompositions of transitive tournaments II
Large graphs with small degree and diameter: a voltage assignment approach
Some constraints on the missing Moore graph
Crossed-inverse quasigroups with long inverse cycles and applications to cryptography
Counting general phylogenetic networks
More classes of super cycle-antimagic graphs
Concerning cyclic group divisible designs with block size three
Young raising operators and Q-functions
Existence of HSOLSSOMs of type 4 n u 1
A characterization of locating-domination edge critical graphs
Beans functions of graphs with small beans
The Tutte polynomial and the generalized Petersen graph
A new parameter on resolving sets with a realizable triple
On loose 3-cycle decompositions of complete 4-uniform hypergraphs
Parity and tiling by trominoes
Planar graphs, regular graphs, bipartite graphs and Hamiltonicity: Corrigendum
Digraphs with isomorphic underlying and domination graphs: 4-cycles and pairs of paths
Totally antimagic total graphs
The value of the Ramsey number R(C n , K 4 ) is 3(n-1)+1 (n≥4)
The class of {3K 1 , C 4 }-free graphs
On the complexity and combinatorics of covering finite complexes
Ratio of generalized stability and domination parameters
Improved bounds for uniform hypergraphs without property B
Fans are cycle-antimagic
Cycle decompositions of complete and complete multipartite graphs
Beaches, bays and headlands
Degree sum conditions and vertex-disjoint cycles in a graph
Steiner minimal trees on the union of two orthogonal rectangles
New lower bounds of fifteen classical Ramsey numbers
Bounds of edge-neighbor-integrity of graphs
Dominator coloring of Mycielskian graphs
Partitioning Segre varieties and projective spaces
The Mobius function of the small Ree groups
A new upper bound on the Ramsey number R(5, 5)
Group distance magic labeling of Cartesian product of cycles
Constructive lower bounds for Ramsey numbers from linear graphs
A 2-factor in which each cycle contains a vertex in a specified stable set
On the configurations of nine points on a cubic curve
A study on H-line graphs
Strong subtournaments of close to regular multipartite tournaments
Perfect hash families from transversal designs
Minimal (n) and (n, h, k) Completely Separating Systems
The q-analog of Kostant's partition function and the highest root of the simple Lie algebras
Extended strict order polynomial of a poset and fixed elements of linear extensions
Broadcasting in planar graphs
A note on inverses of labeled graphs
Braced edges in plane triangulations
Graph theoretic aspects of minimum distance and equivalence of binary linear codes
Closed-neighbourhood anti-Sperner graphs
Generalized vector space partitions
On critically k-edge-connected graphs
One-point extensions of finite inversive planes
Signed edge majority domination numbers in graphs
Note on summation formulas derived from an identity of F.H. Jackson
On disjoint perfect tree-matchings in random graphs
The corner poset with an application to an $n$-dimensional hypercube stacking puzzle
Reducible and purely heterogeneous decompositions of uniform complete multigraphs into spanning trees
An enumeration of 1-perfect binary codes
Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
Orthogonal designs and MDS self-dual codes
Latin and semi-Latin factorizations of complete graphs and support sizes of quadruple systems
Existence of 4-factors in star-free graphs with high connectivity
Assignment problem based algorithms are impractical for the generalized TSP
Quasi-quadrics and related structures
Parallel algorithms for generalized clique transversal problems
Enumeration of snakes and cycle-alternating permutations
Sierpiński gasket graphs and some of their properties
A new inequality related to the Diaconis-Graham inequalities and a new characterisation of the dihedral group
On a reduction theorem for finite, bipartite 2-arc-transitive graphs
$123$-Forcing matrices
Combinatorial aspects of the card game War
About paths with three blocks
A note on isomorphisms of Cayley digraphs of Abelian groups
On a conjecture of Street and Whitehead on locally maximal product-free sets
Block-avoiding sequencings of points in Steiner triple systems
The directed almost resolvable Hamilton-Waterloo problem
How large can the domination numbers of a graph be?
A class of mutually inequivalent circulant weighing matrices
Classroom note: Some partitions of S(2, 3, v 2 ) and S(2, 4, 2 )
Minimizing the regularity of maximal regular antichains of 2- and 3-sets
The spectrum of generalized Petersen graphs
On α-resolvable directed cycle systems for cycle length 4
When does a random graph have constant cop number?
Homogeneous edge-disjoint $K_{2s}$ and $T_{st, t}$ unions
A note on non-jumping numbers
A note on k-extendable graphs and independence number
Grundy chromatic number of the complement of bipartite graphs
A sufficient condition for Hamiltonian cycles in bipartite tournaments
The d-relaxed game chromatic index of k-degenerated graphs
Orthogonal combings of linear sudoku solutions
A note on uniquely pancyclic graphs
A note on higher-dimensional magic matrices
Super edge-antimagic labeling of a cycle with a chord
A characterization of even order trees with domination number half their order minus one
On θ-cyclic codes over 𝔽 2 + v𝔽 2
On minimum vertex covers of generalized Petersen graphs
Broadcast domination and multipacking: bounds and the integrality gap
Some new RBIBDs with block size 5 and PBDs with block sizes ≡1 mod 5
Critical concept for 2-rainbow domination in graphs
Orthogonal arrays and ordered threshold schemes
Splitting group divisible designs with block size 2×4
Lambda-fold complete graph decompositions into perfect four-triple configurations
Resolvable holey group divisible designs with block size three
On covering the square flat torus by congruent discs
A combinatorial problem from group theory
About a Brooks-type theorem for improper colouring
Decomposing block-intersection graphs of Steiner triple systems into triangles
A sharp lower bound for locating-dominating sets in trees
Ordering of the signless Laplacian spectral radii of unicyclic graphs
Obstructions for simple embeddings
The out-arc 5-pancyclic vertices in strong tournaments
A characterization of the graphic split-off matroids
Pancyclic out-arcs of a vertex in a hypertournament
The existence of bimatching designs
Some new near resolvable BIBDs with k=7 and resolvable BIBDs with k=5
3-Perfect hamiltonian decomposition of the complete graph
On the normality of Cayley digraphs of groups of order twice a prime
Inclusion-exclusion, cancellation, and consecutive sets
Adjacent vertex distinguishing edge-colorings of meshes
A few more incomplete self-orthogonal Latin squares and related designs
Simple acyclic graphoidal covers in a graph
Long rainbow cycles in proper edge-colorings of complete graphs
Efficient open domination in digraphs
Covering cubic graphs with matchings of large size
A characterization of uniquely colorable mixed hypergraphs of order n with upper chromatic numbers n-1 and n-2
Burning sufficiently large $p$-caterpillars for a fixed $p$
On odd primitive graphs
On the 2-parallel chromatic index of Steiner triple systems
A note on extending Bondy's meta-conjecture
Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs
On the number of orthomorphisms of the cyclic group of order nine
A note on an upper bound of traceability codes
The k th upper generalized exponent set for primitive matrices
A Fan-type degree condition for k-linked graphs
The Erdős-Gallai theorem modulo k
Connectivity of path graphs
Some graph theoretical aspects of generalized truncations
Some bounds for the signed edge domination number of a graph
Inflations of geometric grid classes: three case studies
Rainbow Turán methods for trees
A note on potentially K 4 -e graphical sequences
The decycling number of graphs
All groups of odd order have starter-translate 2-sequencings
On packing densities of set partitions
A note on the union-closed sets conjecture
On projective planes of order 12 with a collineation group of order 9
On the graceful polynomials of a graph
An isomorphism theorem for digraphs
Maximum embedding of an H(v-w, 3, 1) into a TS(v, λ)
On the characteristic of integral point sets in 𝔼 m
Adjunctions in the study of broadcast domination with a cost function
Some small large sets of t-designs
Some properties of the Knödel graph W(k, 2 k ), k≥4
On matchability of graphs
Pairwise additive 1-rotational BIB designs with λ=1
Premature sets of one-factors
Uniformly resolvable decompositions of K v in 1-factors and 4-stars
Towards the computation of the convex hull of a configuration from its corresponding separating matrix
Further results on smallest defining sets of well known designs
A note on the path cover number of regular graphs
Determining sets
Order ideals in a product of chains
k-independence critical graphs
Partitioning sets of blocks into designs
Binomial determinants and positivity of Chern-Schwartz-MacPherson classes
Note on distance-regular graphs with a pair of equal subdegrees
Maximal partial transversals in a class of Latin squares
Jump systems and laminated Manhattan sets
Counting the spanning trees of the 3-cube using edge slides
Group divisible designs of three groups and block size five with configuration (1, 2, 2)
Coloring of locally planar graphs with one color class small
An upper approximation to the BIBD (15, 21, 7, 5, 2)
A note on small on-line Ramsey numbers for paths and their generalization
Partitioning a cyclic group into well-dispersed subsets with a common gap sequence
A combinatorial interpretation of ramp schemes
On the domination subdivision numbers of trees
Neighborhood total domination of a graph and its complement
A composition theorem for generalized Bhaskar Rao designs
On the number of reachable pairs in a digraph
Isomorphisms of P 4 -graphs
Permutation patterns in Latin squares
Two classes of extreme graphs related to the maximum degree of an interchange graph
Deficiencies and vertex clique covering numbers of a family of trees
A note on max-leaves spanning tree problem in Halin graphs
Inverting non-invertible labeled trees
On unique minimum dominating sets in some repeated Cartesian products
Decycling sets in certain cartesian product graphs with one factor complete
Products and factorizations of ternary complementary pairs
Letter representations of m×n×p proper arrays
On the metric dimension of incidence graphs of Möbius planes
Maximum packing and minimum covering of the line graph of the complete graph with kite
On the super edge-magic deficiency of some families related to ladder graphs
On Bottcher's mysterious identity
A census of the orientable biembeddings of Steiner triple systems of order 15
Chromatic polynomials and toroidal graphs
On minimal triangle-free graphs with prescribed 1-defective chromatic number
The 2-star spectrum of stars
On the centrosymmetric permutations in a class
Covering separating systems and an application to search theory
On the order of almost regular bipartite graphs without perfect matchings
A linear algebraic approach to directed designs
Small 4-regular planar graphs that are not circle representable
On vertex-magic and edge-magic total injections of graphs
Minimal 1-saturating sets in PG(2, q), q≤16
Transgression and the calculation of cocyclic matrices
On 132-representable graphs
Constructing internally disjoint pendant Steiner trees in Cartesian product networks
Counting permutations and polynomials with a restricted factorization pattern
All 2-regular graphs with uniform odd components admit ρ-labellings
On (k, l)-radii of wheels
A correction in the formula for the number of spanning trees in threshold graphs
On the cyclic decomposition of circulant graphs into almost-bipartite graphs
Amicable orthogonal designs of order 8 for complex space-time block codes
Configurations and trades in Steiner triple systems
Satellite communications and multigraph edge-coloring
Decompositions of complete equipartite graphs into cycles of lengths 3 and 6
Enumeration of edge-critical underlying absolute planar cliques for signed graphs
Results for the n-queens problem on the Möbius board
On the Ramsey number of the quadrilateral versus the book and the wheel
On homometric sets in graphs
Pattern avoidance in k-ary heaps
Equivalence classes of 5-bit Gray codes
Bipartite edge partitions and the former Alon-Saks-Seymour conjecture
A Turán-type generalization of Tuza's triangle edge cover problem
Metamorphosis of 2-fold 4-cycle systems into maximum packings of 2-fold 6-cycle systems
Basic subgraphs and graph spectra
Antimagic labeling of the union of stars
Partial generalized Bhaskar Rao designs over abelian groups
Hypercycle systems
Odd colourings, conflict-free colourings and strong colouring numbers
Gallai-Ramsey numbers of C 10 and C 12
On weighted mean distance
On circulant and two-circulant weighing matrices
On cross-intersecting families of independent sets in graphs
The vector graph and the chromatic number of the plane, or how NOT to prove that χ(E 2 )>4
Inequalities for two systems of subspaces with prescribed intersections
Strong edge-magic labelling of a cycle with a chord
Sum of squares of hook lengths and contents
On a conjecture on total domination in claw-free cubic graphs: proof and new upper bound
On graphs satisfying a strong adacency property
On the spectrum of the forced matching number of graphs
Induced stars in trees
Chromatic numbers of 6-regular graphs on the Klein bottle
Pattern-avoiding even and odd Grassmannian permutations
Note: A new proof of an inequality for finite planar spaces
Combinatorial results for certain semigroups of partial isometries of a finite chain
Vertex-edge marking score of certain triangular lattices
Special issue in honour of Dan S. Archdeacon: Guest Editorial
A reduction theorem for circulant weighing matrices