yusuke1997/dblp-id-title huggingface dataset:
On paths and cycles dominating hypercubes
Pascal triangles, Catalan numbers and renewal arrays
Spherical codes attached to complex weighing matrices
Maximal sets of given diameter in the grid and the torus
The structure of neighbor disconnected vertex transitive graphs
On distance-regular Cayley graphs of generalized dicyclic groups
Partial cubes are distance graphs
Lower bounds on the lengths of node sequences in directed graphs
Hamilton decompositions of balanced complete multipartite graphs with primitive leaves
Maximal partial spreads and the modular n-queen problem II
Heterochromatic tree partition problem in complete tripartite graphs
Nonexistence of linear codes meeting the Griesmer bound
Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability
Modelling finite geometries on surfaces
A characterization of bipartite graphs associated with BIB-designs with lambda = 1
Color the cycles
Covering projections of graphs preserving links of vertices and edges
Pattern avoidance in "flattened" partitions
Tetrahedron manifolds via coloured graphs
K 1, 3 -factors in graphs
Cameron's construction of two-graphs
On i - -ER-critical graphs
Countable ultrahomogeneous antimatroids of convex dimension 2
Well-covered circulant graphs
Some inequalities for multidimensional (0, 1)- matrices
Rainbow Hamiltonicity and the spectral radius
Rhombic tilings of (n, k)-Ovals, (n, k, λ)-cyclic difference sets, and related topics
Characterization of embedded special manifolds
Balanced two-colorings of finite sets in the cube
Destroying automorphisms by fixing nodes
Conjectures on the enumeration of tableaux of bounded height
Computing and estimating the number of n-ary Huffman sequences of a specified length
Proprietes De "Longueur De Chaine" Dans L'ensemble Des Fermetures Superieures Sur Un Ensemble Ordonne
The number of tiered posets modulo six
Corrigendum to "Enumeration of eulerian and unicursal planar maps" [Discrete Math. 282 (2004) 208-221]
On Laplacian energy of graphs
Edge-coloring of multigraphs
On the growth of Stanley sequences
More large sets of resolvable MTS and resolvable DTS with odd orders
A characterization of some [n, k, d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
Weighted lattice polynomials
A Dirac theorem for trestles
Laplacian eigenvalues of the second power of a graph
Finding direct partition bijections by two-directional rewriting techniques
The average degree of an edge-chromatic critical graph
New results in the packing of equal circles in a square
On independent domination number of regular graphs
On the reliability roots of simplicial complexes and matroids
Chirality and projective linear groups
The gap number of the T-tetromino
A Riemann hypothesis analogue for invariant rings
The optimal χ-bound for (P7,C4,C5)-free graphs
Cyclotomic numbers, coding theory and orthogonal polynomials
Hyperplanes of DW(2n-1, q), q != 2, without ovoidal quads
The maximum number of edges in a graph of bounded dimension, with applications to ring theory
A large order asymptotic existence theorem for group divisible 3-designs with index one
Basis criteria for generalized spline modules via determinant
Regular totally domatically full graphs
Tutte uniqueness of line graphs
Finite bases for some PBD-closed sets
Acyclic edge coloring of subcubic graphs
Properties of minimally t-tough graphs
Classes of finite relations as initial abstract data types I
Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs
A characterization of projective subspaces of codimension two as quasi-symmetric designs with good blocks
Reconfiguring dominating sets in some well-covered and other classes of graphs
On generalized semidirect product of association schemes
On graphs with equal edge-connectivity and minimum degree
On the existence of hyper-L triple-loop networks
Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes
Hamilton cycles in digraphs of unitary matrices
Sharp bound on the truncated metric dimension of trees
On the pebbling threshold of paths and the pebbling threshold spectrum
On a class of Hamiltonian polytopes
The chip-firing game
On the eigenvalues of certain matrices over Z m
The evolution of unavoidable bichromatic patterns and extremal cases of balanceability
Characters of wreath products and some applications to representation theory and combinatorics
A chromatic partition polynomial
Trees with equal domination and tree-free domination numbers
The average size of a connected vertex set of a k -connected graph
Toughness and Hamiltonicity of a class of planar graphs
Ordering Q -indices of graphs: Given size and circumference
Some results on Betti numbers of Stanley-Reisner rings
Sur les anagrammes alternés
Degree-bounded factorizations of bipartite multigraphs and of pseudographs
Ordering trees with n vertices and matching number q by their largest Laplacian eigenvalues
Tight description of faces of triangulations on the torus
A new view toward vertex decomposable graphs
Modulus for bases of matroids
On four color monochromatic sets with nondecreasing diameter
Incidence graphs and subdesigns of semisymmetric designs
Recursions associated to trapezoid, symmetric and rotation symmetric functions over Galois fields
On a formula for the number of Euler trails for a class of digraphs
Forbidden subgraphs that imply k-ordered and k-ordered hamiltonian
Q 4 -irreducible even triangulations of the projective plane
The number of C 3 -free vertices on 3-partite tournaments
Arithmetic into geometric progressions through Riordan arrays
Bipartite secret sharing and staircases
A note on Reed's conjecture for triangle-free graphs
A note on k-strongly connected orientations of an undirected graph
Optimal binary linear codes of dimension at most seven
On the decomposition of a minimally strongly h-connected digraph into h+1 acircuitic sub-graphs
Extremal graphs in some coloring problems
Convex 3-polytopes with exactly two types of edges
Degree bounds for linear discrepancy of interval orders and disconnected posets
A finite graph which is locally a dodecahedron
The superconnectivity of large digraphs and graphs
Closure and forbidden pairs for 2-factors
On a conjecture of regular graphs having the minimum number of induced paths of length two
All P 3 -equipackable graphs
The k -generalized Hermitian adjacency matrices for mixed graphs
Grid intersection graphs and boxicity
Distances forbidden by two-colorings of Q and A n
Parity vertex coloring of outerplane graphs
Group irregularity strength of disconnected graphs
Weak cycle partition involving degree sum conditions
Skew chain orders and sets of rectangles
The chromatic uniqueness of certain broken wheels
Enumerations of plane trees with multiple edges and Raney lattice paths
Long antipaths and anticycles in oriented graphs
Some geometric structures and bounds for Ramsey numbers
Les distributions euler-mahoniennes sur les mots
Support weight distribution of Z 4 -linear codes
The number of equivalence classes of symmetric sign patterns
Stability of Kronecker coefficients via discrete tomography
The number of finite relational structures
On perfection and imperfection of one-realizations of a given set
A relative of the Thue-Morse sequence
Une demonstration combinatoire de la formule de lagrange a deux variables
Minimal and maximal elements in two-sided cells of S n and Robinson-Schensted correspondence
Minimum proper interval graphs
A proof of the q, t-Catalan positivity conjecture
On some algorithmic aspects of hypergraphic matroids
On the signed chromatic number of some classes of graphs
The maximum number of diagonals of a cycle in a block and its extremal graphs
Characterization of the set of values f(n) = [na], n = 1, 2, ..
The trace reconstruction problem for spider graphs
A constructive characterization of contraction critical 8-connected graphs with minimum degree 9
On the structure of a random sum-free set of positive integers
Pasch trades with a negative block
Congruence classes in M 3 ( F q ) ( q odd)
Hypergraphs without a large star
Cayley graphs as classifiers for data mining: The influence of asymmetries
A note on {4}-GDDs of type 2 10
On eigenvalue multiplicity in signed graphs
Self-generating sets, integers with missing blocks, and substitutions
Dérangements et nombres de Genocchi
The existence of simple S 3 (3, 4, v)
Degenerate and n-adic versions of Kummer's congruences for values of Bernoulli polynomials
l-Regular rotations of the countably infinite complete graph
Two results about Matula numbers
Corrigendum to "A classification of the structures of some Sperner families and superimposed codes": [Discrete Math. 306 (2006) 1722-1731]
Graph-like spaces: An introduction
Novel structures in Stanley sequences
The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs
Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
Spanning 3-strong tournaments in 5-strong semicomplete digraphs
On the combinatorics of polynomial generalizations of Rogers-Ramanujan-type identities
Dichotomies properties on computational complexity of S-packing coloring problems
Automorphism groups of block designs which are block transitive
Planar graphs without specific cycles are 2-degenerate
The Doyen-Wilson theorem for maximum packings of K n with 4-cycles
Sunflower hypergraphs are chromatically unique
An extremal problem for vertex partition of complete multipartite graphs
Graphs isomorphic to subgraphs of their line-graphs
On king-serf pair in tournaments
Domination of generalized Cartesian products
Incidence coloring of k-degenerated graphs
Further results on optimal optical orthogonal codes with weight 4
New constructions of non-adaptive and error-tolerance pooling designs
Erdös-Ko-Rado-type results over J q (n, d), H q (n, d) and their designs
2-Regular equicolourings for P 4 -designs
Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics
Pseudototal colourings of digraphs
On the structure of regular pairwise balanced designs
On a symmetric q-series identity
Primitive one-factorizations and the geometry of mixed translations
On a family of highly regular graphs by Brouwer, Ivanov, and Klin
New bounds on the Ramsey number r(Im, Ln)
Maximal 2-distance sets containing the regular simplex
On matroids determined by their Tutte polynomials
Euclidean embeddings of finite metric spaces
A note on spectral radius and degree deviation in graphs
The b-chromatic index of graphs
Universal cycles for permutations
A matching game
Irredundance number versus domination number
Characterizations for P>=2-factor and P>=3-factor covered graphs
Factor-complement partitions of ascending k-parameter words
A set intersection theorem and an application to a bipartite Ramsey theorem
Covering and independence in triangle structures
Posets admitting a unique order-compatible topology
Generalizations of lattices via non-deterministic operators
Enumeration of intersecting families
A lower bound for the chromatic capacity in terms of the chromatic number of a graph
Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
Turán and Ramsey numbers in linear triple systems II
Partial difference equations in m 1 >=m 2 >= ... >=m n >=0 and their applications to combinatorics
On a conjecture of Tuza about packing and covering of triangles
Cyclotomic polynomials and nonstandard dice
A note on local colorings of graphs
Using error-correcting codes to construct solvable pebbling distributions
On hamiltonian colorings of graphs
More sufficient conditions for a graph to have factors
The linear 3-arboricity of K n, n and K n
Defect-d matchings in graphs with cyclomatic numbers 0, 1 and 2
Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs
On the distance connectivity of graphs and digraphs
On a problem of Neumann
Dominating cycles in regular 3-connected graphs
Ordering (signless) Laplacian spectral radii with maximum degrees of graphs
Edge coloring regular graphs of high degree
A Euclidean Ramsey theorem
A note on the chromatic uniqueness of W 10
Enumeration of dimer (domino) configurations
Repetitions of Pak-Stanley labels in G-Shi arrangements
On small subgraphs in a random intersection digraph
On the existence of 2-designs S lambda (2, 3, upsilon) without repeated blocks
The last subconstituent of the Hemmeter graph
On the independence ratio of distance graphs
All 2-regular graphs consisting of 4-cycles are graceful
Groups assembled from free and direct products
Some results related to permanental inequalities
A characterization of substitutive sequences using return words
The Collatz map analogue in polynomial rings and in completions
On spanning tree congestion of graphs
On the Brauer-Wielandt-Harada theorem for group-like regular association schemes
A generalization of the perfect shuffle
Determinants, choices and combinatorics
The structure of imperfect critically strongly-imperfect graphs
Equitable Δ-coloring of graphs
Doubly alternating Baxter permutations are Catalan
Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
Partitions of n that avoid partitions of f, and an application to the tiny-pan coin weighing problem
On K s, t -minors in graphs with given average degree, II
The threshold strong dimension of a graph
On the small graphs with chromatic number 5 without 4-cliques
On the chromatic number of Latin square graphs
(P, Q)-Total (r, s)-colorings of graphs
Total domination and total domination subdivision number of a graph and its complement
List homomorphism problems for signed trees
MacWilliams type identities for linear codes on certain pomsets: Chain, direct and ordinal sum of pomsets
A combinatorial approach to doubly transitive permutation groups
A decomposition theorem for balanced measures
Transversals of longest paths
Special algorithms for convolutions over Galois fields
Maximal proper subgraphs of median graphs
Symmetric designs with λ ⩽ 10 admitting flag-transitive and point-primitive almost simple automorphism groups
On mean values of some arithmetic functions in number fields
Periodicity and unbordered segments of words
Character sums and MacWilliams identities
Bijective enumeration of some colored permutations given by the product of two long cycles
Decomposition of cubic graphs with cyclic connectivity 5
Characterization of graphs with eigenvalue multiplicity one less than the number of external vertices
On a cyclic connectivity property of directed graphs
Non t-intersecting families of linear spaces over GF(q)
Recognizing Cartesian products in linear time
Neighborhood conditions for graphs with induced claws
An improved upper bound on the covering radius of the logarithmic lattice of Q ( ζ n )
Graphs with the minimum spectral radius for given independence number
A note about shortest cycle covers
Ramsey numbers for triples
The strong fractional choice number of series-parallel graphs
On book-wheel Ramsey number
On a possible extension of Hall's theorem to bipartite hypergraphs
On the complexity of interval orders and semiorders
Game chromatic number of strong product graphs
Gallai-Ramsey numbers for rainbow P 5 and monochromatic fans or wheels
Nowhere-zero 3-flows of claw-free graphs
Freeness for 13 lines arrangements is combinatorial
On an extension of distance hereditary graphs
Colouring proximity graphs in the plane
An algebraic analysis of cladistic characters
The Sudoku completion problem with rectangular hole pattern is NP-complete
Latin directed triple systems
Three-colourability and forbidden subgraphs. II: polynomial algorithms
Star forests, dominating sets and Ramsey-type problems
Extending simplicial complexes: Topological and combinatorial properties
A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs
The chromatic index of multigraphs of order at most 10
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three
On ternary transversal matroids
Recursive construction of non-cyclic pandiagonal Latin squares
Nonexistence of a regular graph design with upsilon = 17 and k = 6
Locating-dominating partitions for some classes of graphs
Classifying 2-arc-transitive graphs of order a product of two primes
On distinct unit fractions whose sum equals 1
A note on the edges of the n-cube
The list L(2, 1)-labeling of planar graphs
A generalization of Kaplansky's game
The chromatic index of graphs with large maximum degree
On matroids on edge sets of graphs with connected subgraphs as circuits II
On the complexity of colouring by superdigraphs of bipartite graphs
On independent doubly chorded cycles
On rank three graphs with a large eigenvalue
Regular separable graphs of minimum order with given diameter
Irregular labelings of circulant graphs
The homomorphism problem for the free monoid
Semi Minkowski i-structures
On the spectral characterization of some unicyclic graphs
Locally finite graphs with ends: A topological approach, III. Fundamental group and homology
p-th order generalized Fibonacci cubes and maximal cubes in Fibonacci p-cubes
Lower bounds for the size in four families of minimum broadcast graphs
Reachability problems in edge-colored digraphs
A new infinite class of ideal minimally non-packing clutters
The maximal length of cloud-antichains
Lower Ramsey numbers for graphs
Rings in boolean algebras
On the forced matching numbers of bipartite graphs
Thue type problems for graphs, points, and numbers
On graphs critical with respect to vertex partition numbers
Faster fractal pictures by finite fields and far rings
The nonexistence of some ternary linear codes of dimension 6
The sum of the k largest distance eigenvalues of graphs
Degree conditions for hamiltonicity: Counting the number of missing edges
Equivalence class universal cycles for permutations
Some enumeration problems for similarity relations
The Steiner ratio of several discrete metric spaces
A strong Pósa Condition for a graphic list to be forcibly Z 3 -connected
Tight 4-factor orthogonal main effect plans
A new proof for the Erdős-Ko-Rado theorem for the alternating group
A construction of some [n, k, d; q]-codes meeting the Griesmer bound
Nullity and singularity of a graph in which every block is a cycle
A projection property and Arrow's impossibility theorem
Edge-apexing in hereditary classes of graphs
The Menger number of the strong product of graphs
Nesting partial Steiner triple systems with 2-regular leave graphs
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
Extremal augmented Zagreb index of trees with given numbers of vertices and leaves
Hamilton-laceable bi-powers of locally finite bipartite graphs
Cyclic sequences of k-subsets with distinct consecutive unions
On the 2-factors of bicubic graphs
On n-extendable graphs
Some polynomials associated with up-down permutations
On packing minors into connected matroids
Standard Young tableaux in a (2, 1)-hook and Motzkin paths
On affine difference sets and their multipliers
A minor-monotone graph parameter based on oriented matroids
Random sets which invariably generate the symmetric group
An evolution of interval graphs
The general counterfeit coin problem
Langford sequences: perfect and hooked
Pattern-restricted permutations composed of 3-cycles
Generating functions and generalized alternating subsets
The jump number problem on interval orders: A 3/2 approximation algorithm
New properties of perfectly orderable graphs and strongly perfect graphs
Class-uniformly resolvable pairwise balanced designs with block sizes two and three
Permuted difference cycles and triangulated sphere bundles
Diagonal flips in pseudo-triangulations on closed surfaces
MDS codes over F 9 related to the ternary Golay code
On vertex Ramsey graphs with forbidden subgraphs
Sign-balanced covering matrices
On the chromatic number of generalized Kneser graphs and Hadamard matrices
The empire problem in even embeddings on closed surfaces with ε ≤0ε≤0
Finite distributive nearlattices
Classes of chromatically equivalent graphs and polygon trees
A polynomial time circle packing algorithm
Size of edge-critical uniquely 3-colorable planar graphs
More on the Terwilliger algebra of Johnson schemes
Foreword/Avant-propos
Reconstruction of distance hereditary 2-connected graphs
The Sprague-Grundy function of the game Euclid
On maximal partial spreads of H(2n+1, q 2 )
Remarks on the cofinality of a partially ordered set, and a generalization of König's lemma
Explicit construction of exponential sized families of k-independent sets
A construction of non-isomorphic amorphous association schemes from pseudo-cyclic association schemes
Towards the critical problem: on the coalgebraic relation between sets and multisets
The combinatorics of symmetric functions and permutation enumeration of the hyperoctahedral group
Combinatorial proofs of some limit formulas involving orthogonal polynomials
A sharp refinement of a result of Zverovich-Zverovich
Nonempty intersection of longest paths in series-parallel graphs
Spectral Turán problems on the expansion of matchings
Some self-blocking block designs
Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives
On the genus of joins and compositions of graphs
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number
Relative de Morgan lattices
An improved bound for equitable proper labellings
On the number of congruence classes of paths
On perfect 2-colorings of the q-ary n-cube
Solution of two problems of P. Erdös concerning Hamiltonian cycles
Maximum and minimum toughness of graphs of small genus
Asymmetric marking games on line graphs
O(VE) time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with large girth
Hex and combinatorics
The 7-cycle C 7 is light in the family of planar graphs with minimum degree 5
N-flips in even triangulations on the torus and Dehn twists preserving monodromies
Domination analysis of greedy heuristics for the frequency assignment problem
Describing (d-2)-stars at d-vertices, d≤5, in normal plane maps
Planar graphs with maximum degree 4 are strongly 19-edge-colorable
On graphs with a constant link, II
Linear layouts measuring neighbourhoods in graphs
Transitivity of local complementation and switching on graphs
Partial difference sets
The exact gossiping problem
A refined view of a curious identity for partitions into odd parts with designated summands
The group Cp4×Cq is a DCI-group
Extremal graphs with diameter 2 for two indices on resistance-distance
Making multigraphs simple by a sequence of double edge swaps
Plane graphs with maximum degree 9 are entirely 11-choosable
Maximal dimensional partially ordered sets II. characterization of 2n-element posets with dimension n
Enumeration of generalized lattice paths by string types, peaks, and ascents
Clumsy packing of dominoes
Optimal packing of induced stars in a graph
Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
Weak Monge arrays in higher dimensions
Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope
Seven equivalent binomial sums
Binomial ideals of domino tilings
On the sizes of large subgraphs of the binomial random graph
Trimming of metric spaces and the tight span
On quadrangular convex 3-polytopes with at most two types of edges
Contracted k-tessellations of closed surfaces
Interval hypergraphs and D-interval hypergraphs
Adjacency posets of planar graphs
Strong edge-coloring for planar graphs with large girth
On the fractional chromatic number and the lexicographic product of graphs
On Conway's recursive sequence
On light graphs in the family of 4-connected planar graphs
Neutrality and betweenness in modular lattices
The determinant of the Laplacian matrix of a quaternion unit gain graph
Inducibility of directed paths
A note on the adjacent vertex distinguishing total chromatic number of graphs
Groups acting on graphs with polynomial growth
On set systems with restricted intersections modulo p and p-ary t-designs
Antipodality properties of finite sets in Euclidean space