yusuke1997/dblp-id-title huggingface dataset:
A visual proof of a result of Knuth on spanning trees of Aztec diamonds in the case of odd order
Book spreads in PG(7, 2)
The rational case of a matrix problem of Harrison
Permutations selon leurs pics, creux, doubles montées et double descentes, nombres d'euler et nombres de Genocchi
A new proof of Grünbaum's 3 color theorem
The total chromatic number of regular graphs of even order and high degree
Rainbow solutions of linear equations over Z p
On the set of circular total chromatic numbers of graphs
A positive fraction mutually avoiding sets theorem
On embedding a cycle in a plane graph
Packing trees into complete bipartite graphs
Antimagic vertex labelings of hypergraphs
On the uniformity of the closed-set lattice of a tree
An infinite sequence of GammaDelta-regular graphs
Upper bounds for independent domination in regular graphs
A bijective proof of an identity for noncrossing graphs
Designs constructed from maximal arcs
Exponentially many nonisomorphic orientable triangular embeddings of K 12s
Algebraic models for two-edge-connected graphs
On algorithms for discrete problems
On two equimatchable graph classes
A generalized room square GRS(4, 24) of dimension 9
Some determinantal representations of derangement polynomials of types B and D
Corrigendum to "On the sum of the first two largest signless Laplacian eigenvalues of a graph" [Discrete Math. 347 (2024) 114035]
Switching 3-edge-colorings of cubic graphs
Properly colored cycles in edge-colored complete graphs
The [23, 14, 5] Wagner code is unique
Graphs with bounded valency that do not embed in the projective plane
On large complete arcs: odd case
Closure concepts for claw-free graphs
A simple proof and a generalization of an old result of Chung and Feller
Forbidden triples for hamiltonicity
A note on short cycles in diagraphs
More complete intersection theorems
Perfect graphs with unique P 4 -structure
Critical groups for homeomorphism classes of graphs
Symmetric cubic graphs with non-solvable automorphism groups
Netlike partial cubes I. General properties
Conference structures and consistency
Path partition number in tough graphs
Open irredundance and maximum degree in graphs
On balanced colorings of sparse hypergraphs
Decomposition of cubic graphs related to Wegner's conjecture
Hamiltonian circuits in prisms over certain simple 3-polytopes
Characterizing almost-median graphs II
On the reduction of Yutsis graphs
On unique independent sets in graphs
On the spectral radii of unicyclic graphs with fixed matching number
The Cauchy numbers
Partial permutation decoding for the first-order Reed-Muller codes
On an inverse for sections of a binomial matrix
Enumerations of universal cycles for k -permutations
On the pebbling number of Cm×Cn in case of even parity
Acyclic list edge coloring of outerplanar graphs
On Whitney numbers of Dowling lattices
A note on the lacking polynomial of the complete bipartite graph
Light subgraphs of multigraphs on compact 2-dimensional manifolds
Edge coloring of graphs with small average degrees
Distance graphs and the T-coloring problem
Connected graphs without long paths
On the difference between chromatic number and dynamic chromatic number of graphs
An optimal construction for complete graph embeddings with duals of low connectivity
The strong admissibility of finite Moufang loops
Distance-balanced graphs: Symmetry conditions
Short rainbow cycles for families of small edge sets
Counterexamples to the edge reconstruction conjecture for infinite graphs
Polychromatic Hamilton cycles
Restricted sumsets in a finite abelian group
Bounds on the length of a game of Cops and Robbers
On unit distances in a convex polygon
Billiard and the five-gap theorem
Constrained Ramsey numbers for the loose path, cycle and star
Cyclic balanced sampling plans avoiding adjacent units with block size four
A theorem about a conjecture of H. Meyniel on kernel-perfect graphs
Restricted even permutations and Chebyshev polynomials
Erratum to "Upper bounds for domination numbers of the queen's graph": [Discrete Mathematics 242 (2002) 229-243]
A note on flow polynomials of graphs
Breaking the rhythm on graphs
Some remarks on the representation theorem of moisil
Two-ended regular median graphs
Permutations with one or two 132-subsequences
Theorie des ecoulements dans les graphes orientes sans circuit
The combinatorial analysis of patterns and the principle of inclusion-exclusion
Transitive parabolic unitals in translation planes of odd order
Separating subgraphs in k-trees: Cables and caterpillars
On the sum number of wheels
Progress towards the total domination game -conjecture
The number of edge 3-colorings of a planar cubic graph as a permanent
Decomposition of K m, n into short cycles
Association schemes and permutation groups
A spanning tree with at most k leaves in a K1,5-free graph
A-sequences, Z-sequence, and B-sequences of Riordan matrices
Hamiltonicity of the cross product of two Hamiltonian graphs
Spanning trails containing given edges
Exponents of vertex-transitive digraphs
On the restricted connectivity and superconnectivity in graphs with given girth
A linear operator for symmetric functions and tableaux in a strip with given trace
The bondage numbers of graphs with small crossing numbers
On the chromatic number of certain highly symmetric graphs
On a problem raised by P.J. Cameron
Asymptotic lower bounds for Ramsey functions
Counterexample to a conjecture of Jeurissen
Spectral upper bounds for the Grundy number of a graph
Opinion functions on trees
Generalized arboricity of graphs with large girth
Bruen chains in PG(3, p k ), k geq 2
Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs
A note on a lemma of Brauer
On convex segments in a triangulation
The smallest hard-to-color graph for the SL algorithm
Maximal integral point sets in affine planes over finite fields
Recent developments on absolute geometries and algebraization by K-loops
A lower bound for Ramsey's theorem
An extension of a theorem on cycles containing specified independent edges
Antichains in the set of subsets of a multiset
Oriented trees in digraphs
Completing the spectrum of rotational Mendelsohn triple systems
Inner reflectors and non-orientable regular maps
A planarity criterion for cubic bipartite graphs
On list edge-colorings of subcubic graphs
Two new families of 4-designs
Hamiltonian cycles and dominating cycles passing through a linear forest
An improved bound on parity vertex colourings of outerplane graphs
Andrews-Gordon type series for Schur's partition identity
Structural characterization of projective flexibility
On MacWilliams type identities for r-fold joint m-spotty weight enumerators
On the vertex arboricity of planar graphs of diameter two
On cages with given degree sets
On graphs with an eigenvalue of maximal multiplicity
Planar Ramsey numbers for cycles
A counterexample to a generalization of Richardson's theorem
Eigenvalues of complete multipartite graphs
Enumerating alternating matrix spaces over finite fields with explicit coordinates
Arrangements of hemispheres and halfspaces
Power domination in cubic graphs and Cartesian products
No acute tetrahedron is an 8-reptile
Minimal reducible bounds for induced-hereditary properties
A note on the construction of certain BIB designs
Combinatorial Nullstellensatz and DP-coloring of graphs
The obstructions for toroidal graphs with no K 3, 3 's
Economical extremal hypergraphs for the Erdős-Selfridge theorem
Neighborhood unions and disjoint chorded cycles in graphs
Edge-connectivity and edge-disjoint spanning trees
On connectivity of triangulations of manifolds
Uniform edge-c-colorings of the Archimedean tilings
Combinatorial proofs of five formulas of Liouville
Pairwise balanced designs with odd block sizes exceeding five
Signed shape tilings of squares
Nowhere-zero 3-flows of highly connected graphs
The crossing number of K 1, m, n
On a relationship between the characteristic and matching polynomials of a uniform hypertree
The vertex isoperimetric problem for the powers of the diamond graph
Construction of nonisomorphic reverse steiner quasigroups
Descents in powers of permutations
Bipartite matching extendable graphs
Minimum embedding of any Steiner triple system into a 3-sun system via matchings
Locality of connective constants
Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
Dirac-type characterizations of graphs without long chordless cycles
A dominated pair condition for a digraph to be hamiltonian
On the perfect graph conjecture
Shift graphs, chromatic number and acyclic one-path orientations
Distance-regular graphs admitting a perfect 1-code
The set of autotopisms of partial Latin squares
A partition theorem of Tverberg-type for boxes in R 3
The crossing number of K 2, 3 x C 3
On a construction of clay of bib designs from frobenius groups
Free polygon enumeration and the area of an integral polygon
Combinatorics of Jacobi-configurations III: The Srivastava-Singhal generating function revisited
Ramsey numbers r(K 3 , G) for G =~ K 7 - 2P 2 and G =~ K 7 - 3P 2
On embedding well-separable graphs
Group connectivity in line graphs
On contractible and vertically contractible elements in 3-connected matroids and graphs
The intricacy of avoiding arrays is 2
The chromatic uniqueness of W 10
On strongly regular graphs with µ <=2
Minimal balanced sets and finite geometries
Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages
On the chromatic number of the lexicographic product and the Cartesian sum of graphs
Sign balances and promotion order of Young-Fibonacci tableaux
Action graphs and coverings
Minimal linear codes from vectorial functions
List star edge coloring of generalized Halin graphs
Matchings from a set below to a set above
Forbidden pairs and the existence of a dominating cycle
Dowker-type theorems for disk-polygons in normed planes
A construction of higher rank chiral polytopes
Cup stacking in graphs
On Kotzig's conjecture for graphs with a regular path-connectedness
Strong convergence on weakly logarithmic combinatorial assemblies
The graph Ramsey number R(Fℓ, K6)
Facial edge-face coloring of K4-minor-free graphs
Loopless generation of up-down permutations
Acyclic coloring of graphs with maximum degree at most six
Splits of circuits
The order-interval hypergraph of a finite poset and the König property
On cross-bandwidth
Rétractions, corétractions et enveloppe injective d'une algèbre de transitions
An improved upper bound for the order of mixed graphs
The complexity of planar graph choosability
Spectra and eigenspaces of non-normal Cayley graphs
Nonexistence of seven-dimensional tangential 2-blocks
Families of finite sets satisfying a union condition
On semicomplete multipartite digraphs whose king sets are semicomplete digraphs
Exponentially many nonisomorphic genus embeddings of K n, m
On the existence of Hamiltonian paths in the cover graph of M(n)
Generalized Robinson-Schensted correspondences: a new algorithm
The Terwilliger algebra of an almost-bipartite distance-regular graph and its antipodal 2-cover
On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching
Induced saturation for complete bipartite posets
Minimum embedding of balanced P 4 -designs into 5-cycle systems
Decomposition of class II graphs into two class I graphs
Regular Steinhaus graphs of odd degree
Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs
On the reconstruction number of generalized join of graphs
Graphs with large palette index
Block designs admitting regular automorphisms
On sign-invariance graphs of uniform oriented matroids
An impossibility theorem for electoral systems
Uniformly resolvable decompositions of K v into paths on two, three and four vertices
Idempotents of generalized quaternion group algebras and their applications
Transformation of integer programs to knapsack problems
An O( n 2 ) algorithm to color Meyniel graphs
A family of partitions with attached parts and 'N copies of N'
Finite Euclidean graphs and Ramanujan graphs
Further results on the expected hitting time, the cover cost and the related invariants of graphs
An algebraic theory of graph factorization
Total edge irregularity strength of large graphs
A class of complete k-caps of small cardinality in projective spaces over fields of characteristic three
Enumération des partitions de diamètre minimum
The number of perfect matchings in a brick
Maximum genus and chromatic number of graphs
Balanced Cayley graphs and balanced planar graphs
Enumeration of vexillary involutions which are equal to their mirror/complement
Random walks on trees
Gallai-Ramsey number of even cycles with chords
The index set problem for Boolean (or nonnegative) matrices
On asymmetric (0, 1)-matrices with given row and column sum vectors
Generalized Bessel numbers and some combinatorial settings
Forbidden quadruplets generating a finite set of 2-connected graphs
Graph decompositions and D 3 -paths with a prescribed endvertex
On intersections of interval graphs
Intersections of Steiner quadruple systems
The smallest surface that contains all signed graphs on K 4,n
The order type of the collection of finite series-parallel posets
Non-existence of nonorientable regular embeddings of n-dimensional cubes
Constructing highly arc transitive digraphs using a direct fibre product
A census of regular 3-polystroma arising from honeycombs
C n -factors of group graphs
On self-complementary supergraphs of ( n, n )-graphs
An algorithm for partial Grundy number on trees
Domination game on forests
Counting hypercubes in hypercubes
On the existence spectrum for sharply transitive G-designs, G a [k]-matching
Questions about linear spaces
Bounds for the Graham-Pollak theorem for hypergraphs
Preface to GD'05 special issue
New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
Diameter vulnerability of graphs by edge deletion
Average connectivity and average edge-connectivity in graphs
Infinite series of double Youden rectangles
Graph products and integer domination
Constructions of MDS entanglement-assisted quantum codes with flexible lengths and large minimum distance
On MPS construction of blocking sets in projective spaces: A generalization
The enumeration of stack polytopes and simplical clusters
Bounds relating generalized domination parameters
Asymptotical properties of linear codes
A direct algorithm to compute rational solutions of first order linear q -difference systems
Factors and vertex-deleted subgraphs
Hyperplane sections of determinantal varieties over finite fields and linear codes
The pebbling threshold of the square of cliques
Cycles through given vertices and closures
Highly irregular graphs with extreme numbers of edges
Skip letters for short supersequence of all permutations
Generating sequences of clique-symmetric graphs via Eulerian digraphs
A Ramsey problem of Harary on graphs with prescribed size
On the length of longest alternating paths for multicoloured point sets in convex position
The weight enumerator polynomials of some classes of codes with composite parity-check polynomials
A generalization of Fan's results: Distribution of cycle lengths in graphs
An improved upper bound for the pebbling threshold of the n -path
The principal Erdős-Gallai differences of a degree sequence
On Hamming distance distributions of repeated-root constacyclic codes of length 3 p s over Fpm+uFpm
Remarks about disjoint dominating sets
A decomposition property of basic acyclic graphs
3-colourability of Penrose kite-and-dart tilings
The number of complete subgraphs of equi-partite graphs
Non-uniqueness of minimal superpermutations
A survey of complex generalized weighing matrices and a construction of quantum error-correcting codes
Edge-colouring and total-colouring chordless graphs
Partition theorems for factorisations of ascending parameter words
Edge cuts leaving components of order at least m
On Dilworth's decomposition theorem
Decomposition by clique separators
Asymptotics of self-overlapping permutations
New semiregular divisible difference sets
Interval edge-colorings of complete graphs
Equistarable bipartite graphs
On maximum signless Laplacian Estrada indices of k-trees
Spanning subgraph with Eulerian components
Binary relations and reduced hypergroups
An extension of the multi-path algorithm for finding hamilton cycles
On the index of caterpillars
A remark on doubly diagonalized orthogonal Latin squares
Graph designs for the eight-edge five-vertex graphs
A generalization of Calkin's identity
An explicit form of the inverse of a particular circulant matrix
On some structural properties of generalized fullerene graphs with 13 pentagonal faces
Long paths with endpoints in given vertex-subsets of graphs
Decomposition family and spectral extremal problems on non-bipartite graphs
Automorphism group of 2-token graph of the Hamming graph
The D-optimal saturated designs of order 22
Counting rooted near-triangulations on the sphere
A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type
The struction algorithm for the maximum stable set problem revisited
Maximization of combinatorial Schrödinger operator's smallest eigenvalue with Dirichlet boundary condition
Small meshes of curves and their role in the analysis of optimal meshes
Realizing degree imbalances in directed graphs
On point-linear arboricity of planar graphs
Results on partial geometries with an abelian Singer group of rigid type
A note on ascending subgraph decompositions of complete multipartite graphs
Defective choosability results for outerplanar and related graphs
Terwilliger algebras and some related algebras defined by finite connected simple graphs
Determinantal formula for generalized riffle shuffle
Graphs and Hermitian matrices: eigenvalue interlacing
New constructions of reversible DNA codes
Path decompositions of triangle-free graphs
A short proof of the Chen-Manalastas theorem
A test for legitimate decks
Non-trivial GammaDelta-regular graphs
Hamiltonian properties of 3-connected {claw, hourglass}-free graphs
Decompositions of edge-colored infinite complete graphs into monochromatic paths
Diameter and connectivity of 3-arc graphs
Bipartite regular graphs and shortness parameters
Maximal total absolute displacement of a permutation
Line-graphs of cubic graphs are normal
Pfaff's method (I): The Mills-Robbins-Rumsey determinant
Spectral extremal problem on the square of ℓ-cycle
Congruences for the number of partitions and bipartitions with distinct even parts
Important algebraic calculations for n-variables polynomial codes
On a Nordhaus-Gaddum type problem for independent domination
Identities of Rothe-Abel- Schläfli-Hurwitz-type
Endomorphism monoids of chained graphs
The k-restricted edge connectivity of undirected Kautz graphs
On partitions of two-dimensional discrete boxes
On Ramsey number R(4, 3, 3) and triangle-free edge-chromatic graphs in three colors
Restrained domination in trees
The existence of KS 3 (v; 2, 4)
On domination and independent domination numbers of a graph
A combinatorial identity with application to Catalan numbers
The Baillon-Simons theorems
The number of distinct symbols in sections of rectangular arrays
Polychromatic 4-coloring of cubic even embeddings on the projective plane
Size of weakly saturated graphs
Edge-connectivity in P k -path graphs
Restrained domination in graphs
Extremal Type II ℤ 4 -codes constructed from binary doubly even self-dual codes of length 40
The base of a primitive, nonpowerful sign pattern with exactly d nonzero diagonal entries
Defining sets in vertex colorings of graphs and latin rectangles
Upper bound for the geometric-arithmetic index of trees with given domination number
A non-commutative generalization of k-Schur functions
An enumeration of combinatorial 3-manifolds with nine vertices
Equitable specialized block-colourings for 4-cycle systems - I
A network flow approach to a common generalization of Clar and Fries numbers
On the primality of 2 h *3 n +1
Minimal triangulation of the 4-cube
Colourings of oriented connected cubic graphs
Independent domination in regular graphs
Distance monotone graphs and a new characterization of hypercubes
Arrays with fixed row and column sums
A not 3-choosable planar graph without 3-cycles
Independence and connectivity in 3-domination-critical graphs
On the sphericity of the graphs of semiregular polyhedra
Cayley digraphs with normal adjacency matrices
On sets of three mols with holes
Edge-cuts leaving components of order at least three
An interpretation of the Dittert conjecture in terms of semi-matchings
Degree sequences of matrogenic graphs
Construction of good cyclic codes and quantum error correcting codes using reversed Dickson polynomials
Balanced tournament designs and related topics
Left dihedral codes over finite chain rings
r-Dominating cliques in graphs with hypertree structure
Enumeration of multi-colored rooted maps
Trees of integral triangles with given rectangular defect
A Motzkin filter in the Tamari lattice
Sums of subsequences modulo prime powers
The Monochromatic Column problem
On Davenport's constant of finite abelian groups with rank three
New and old results on flocks of circle planes
On even codes
A note on coloring sparse random graphs
The asymptotic number of spanning forests of complete bipartite labelled graphs
The spectra of a variety of quasigroups and related combinatorial designs
Strongly well-covered graphs
Permanent of the laplacian matrix of trees with a given matching
The chromatic symmetric function in the star-basis
First facets of the octahedron
Lower bounds on the minimum average distance of binary codes
Non-monochromatic non-rainbow colourings of σ-hypergraphs
Linear spaces with projective lines
Minimally 4-edge # -connected graphs
The disengagement algorithm or a new generalization of the exclusion algorithm
Monochromatic square-cycle and square-path partitions
On configurations of type (q2-q-2)q-1
Almost all quartic half-arc-transitive weak metacirculants of Class II are of Class IV
The geodetic number of the lexicographic product of graphs
On Hamiltonian decompositions of complete 3-uniform hypergraphs
Contractible graphs for flow index less than three
Retractions of split graphs and End-orthodox split graph
Le nombre maximal de 3-colorations d'un graphe connexe
Finite families of forbidden subgraphs for rainbow connection in graphs
Multi-set neighbor distinguishing 3-edge coloring
The dimension of projective geometry codes
New perspectives on polynomial invariants
Subdivided trees are integral sum graphs
Some results on Ramsey numbers using sumfree sets
Perpendicular orders
Rook polynomials on two-dimensional surfaces and graceful labellings of graphs
Long cycles through specified vertices
Classes of chromatically unique graphs
Pattern-avoiding stabilized-interval-free permutations
The volume and foundation of star trades
A note on acyclic edge coloring of complete bipartite graphs
On the parameters of codes for the Lee and modular distance
Bootstrapping the primitive recursive functions by only 27 colors
Dirac's minimum degree condition restricted to claws
Upper bounds for the k -subdomination number of graphs
Interval graphs and seatching
Total weak unimodularity: testing and applications
The Erdős-Sós conjecture for graphs of girth 5
Which Faber-Moore-Chen digraphs are Cayley digraphs?
Incremental construction properties in dimension two--shellability, extendable shellability and vertex decomposability
Sur les extensions lineaires d'une famille particuliere d'ordres partiels
The strong perfect graph conjecture holds for diamonded odd cycle-free graphs
Remarks on pseudo-vertex-transitive graphs with small diameter
Minimax arcs
On bijections that preserve complementarity of subspaces
Multiply partition regular matrices
Efficient data structures for Boolean functions
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
On the number of flats spanned by a set of points in PG(d, q)
On infinite bridged graphs and strongly dismantlable graphs
On 1-factors of point determining graphs
The chromatic number of 5-valent circulants
Cayley type graphs and cubic graphs of large girth
On non-singular Hermitian varieties of PG(4, q2)
Separating path systems for the complete graph