yusuke1997/dblp-id-title huggingface dataset:
Sufficient conditions for a graph to have factors
On finite matroids with two more hyperplanes than points
Arc-transitive circulant digraphs of odd prime-power order
Counting dominating sets and related structures in graphs
A combinatorial result on points and circles on the plane
Optimal shadows and ideals in submatrix orders
Spanning multi-paths in hypercubes
Covering the k-skeleton of the 3-dimensional unit cube by six balls
Direct product and uniqueness of automorphism groups of graphs
Partite saturation number of cycles
A complete solution to the chromatic equivalence class of graph I
Colorings of plane graphs: A survey
Representation of permutations as products of two cycles
A sufficient condition for maximum cycles in bipartite digraphs
Knots and links in spatial graphs: A survey
Orthogonal latin squares with subsquares
The Doyen-Wilson theorem for bull designs
Regular parallelisms in kinematic spaces
Sperner theory in a difference of Boolean lattices
A lower bound on the acyclic matching number of subcubic graphs
A simple characterization of special matchings in lower Bruhat intervals
On diameter critical graphs
The Terwilliger algebra of an almost-bipartite P- and Q-polynomial association scheme
Local bases of primitive non-powerful signed digraphs
Geodesics on the regular tetrahedron and the cube
Write-isolated memories (WIMs)
Periodic de Bruijn triangles: exact and asymptotic results
A combinatorial basis for Terwilliger algebra modules of a bipartite distance-regular graph
Z-transformation graphs of perfect matchings of hexagonal systems
Constructing strength three covering arrays with augmented annealing
Revisiting the Comellas-Fiol-Gómez constructions of large digraphs of given degree and diameter
The k-metric dimension of the lexicographic product of graphs
Semi-planar Steiner loops of cardinality 2 n
Equitable 2-partitions of the Johnson graphs J(n,3)
Type 2 constacyclic codes over F2m[u]∕〈u3〉 of oddly even length
Transversals in completely reducible multiary quasigroups and in multiary quasigroups of order 4
The edge spectrum of the saturation number for small paths
A note on distinguishing trees with the chromatic symmetric function
On heights in the Collatz 3n + 1 problem
On the q -binomial identities involving the Legendre symbol modulo 3
Eccentric graph of trees and their Cartesian products
An inequality for chromatic polynomials
A new characterization of strongly chordal graphs
Normal and non-normal Cayley graphs for symmetric groups
Disjoint cycles in graphs with distance degree sum conditions
Quadrangular embeddings of the complete even k-partite graph
On covering a product of sets with products of their subsets
A new inequality for distance-regular graphs
Cyclic codes over GF(q) with simple orbit structure
Robustness of balanced fractional 2 m factorial designs derived from simple arrays
q-Analogs of the inclusion- exclusion principle and permutations with restricted position
Incongruent restricted disjoint covering systems
Maximal independent sets in minimum colorings
Self-dual codes from quotient matrices of symmetric divisible designs with the dual property
4-labelings and grid embeddings of plane quadrangulations
Transformation graph G -+-
Shortened recurrence relations for Bernoulli numbers
The covering radius problem for sets of 1-factors of the complete uniform hypergraphs
A new characterization of median graphs
The level polynomials of the free distributive lattices
Lower bounds on several versions of signed domination number
Unitals and codes
Corrigendum to "Velocity polytopes of periodic graphs and a no-go theorem for digital physics" [Discrete Mathematics 313 (2013) 1289-1301]
Permutations with forbidden subsequences and nonseparable planar maps
Intersection of modules related to Macdonald's polynomials
Minimal superior ultrametrics under order constraint
On the role of hypercubes in the resonance graphs of benzenoid graphs
Generalized Dyck paths
On the number of graphs without 4-cycles
On isomorphisms of connected Cayley graphs
The enumeration of arrays and a generalization related to contingency tables
Vertex-edge domination in cubic graphs
A simple bijection between a subclass of 2-binary trees and ternary trees
Discrepancies between metric dimension and partition dimension of a connected graph
Hook and content bijections
Subgraph isomorphism in graph classes
Cut equivalence of d-dimensional guillotine partitions
On 2-arc-transitive bi-Cayley graphs of finite simple groups
Multiple extensions of a finite Euler's pentagonal number theorem and the Lucas formulas
Congruences modulo powers of 3 for 3- and 9-colored generalized Frobenius partitions
A note on difference matrices over non-cyclic finite abelian groups
Lower bounds for some Ramsey numbers
Spanning cubic graph designs
A (2, 11) combinatorial groupoid
The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
The Path Partition Conjecture is true for claw-free graphs
Character sums and nonlinear recurrence sequences
Constructive graph labeling using double cosets
Combinatorial study of colored Hurwitz polyzêtas
Minimal zero-sequences and the strong Davenport constant
A note on growing binary trees
On a p-adic interpolation function for the q-extension of the generalized Bernoulli polynomials and its derivative
On exteriority notions in book embeddings and treewidth
Extremal spectral radius and g-good r-component connectivity
The number of triangles in a K 4 -free graph
The biweight enumerator of self-orthogonal binary codes
On incidence coloring and star arboricity of graphs
Regular hamiltonian embeddings of K n, n and regular triangular embeddings of K n, n, n
On the complexity of the independent set problem in triangle graphs
Independence number of products of Kneser graphs
Existence and uniqueness theorem for a 3-dimensional polytope in R3 with prescribed directions and perimeters of the facets
A study of covering dimension for the class of finite lattices
Weight hierarchies of a family of linear codes associated with degenerate quadratic forms
On completely regular codes with minimum eigenvalue in geometric graphs
Les hypercartes planaires sont des arbres tres bien etiquetes
Random walks and orthogonal functions associated with highly symmetric graphs
The functorial composition of species, a forgotten operation
Exponential numbers of two-weight codes, difference sets and symmetric designs
Columns of uniform color in a rectangular array with rows having cyclically repeated color patterns
A lower bound on the number of functions satisfying the strict avalanche criterion
New families of graphs determined by their generalized spectrum
When is a partial Latin square uniquely completable, but not its completable product?
Cographs: Eigenvalues and Dilworth number
Pattern statistics in faro words and permutations
Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results
Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs
A generalisation of Johnson graphs with an application to triple factorisations
Some VLSI decompositions of the de Bruijn graph
Enumeration of arrays of a given size
The structure of median graphs
Embedding of a pseudo-point residual design into a Möbius plane
Recovering trees from well-separated multi-state characters
A characterization of rho alpha( k )-perfect graphs
Incidence matrices of finite attenuated spaces and class dimension of association schemes
From graceful labellings of paths to cyclic solutions of the Oberwolfach problem
On the relative distances of eleven points in the boundary of a plane convex body
Strongly 2-perfect cycle systems and their quasigroups
The minimum number of vertices with girth 6 and degree set D ={ r, m }
Further results on large sets plus of partitioned incomplete Latin squares
Ovals and hyperovals in nets
Analyzing n n-player Maundy Cake
On the total domination number of cross products of graphs
The smallest point sets that meet all generators of H (2 n, q 2 )
On arcs in path designs of block size four
Using maximality and minimality conditions to construct inequality chains
Small embedding of an S 3 (2, 4, u) into an S λ (2, 4, u+w)
Total embedding distributions of Ringel ladders
A note on 'on antipodal graphs'
Systems of MDS codes from units and idempotents
The perimeter generating function for nondirected diagonally convex polyominoes
On graph closures
Some results on Laplacian spectral radius of graphs with cut vertices
A bipartite Erdös-Ko-Rado theorem
Turán and Ramsey numbers in linear triple systems
Zonal polynomials and domino tableaux
The numbers of edges of the order polytope and the chain polytope of a finite partially ordered set
Embedding an incomplete latin square in a latin square with a prescribed diagonal
On the noninterpolation of polyhedral maps
Some series of cyclic balanced hyper-graeco-Latin superimpositions of three Youden squares
Functions on tableau frames
Chebyshev polynomials and spanning tree formulas for circulant and related graphs
Partial DP-coloring of graphs
The geometric cone relations for simplicial and cubical complexes
On hyperbolic sets of maxes in dual polar spaces
Color-avoiding percolation of random graphs: Between the subcritical and the intermediate regime
On (0, 1)-matrices with prescribed row and column sum vectors
The Langford (4, n)-sequence: A trigonometric approach
Minimum saturated graphs for unions of cliques
Combinatorially fruitful properties of 3.2 -1 and 3.2 -2 modulo p
More odd graph theory
A generalization of rotational tournaments
On conjugacies of the 3x+1 map induced by continuous endomorphisms of the shift dynamical system
Counterexample to a conjecture on Hamilton cycles
Pancomponented 2-factorizations of complete graphs
An orderly algorithm and some applications in finite geometry
A note on connected domination number and leaf number
Forbidden minors to graphs with small feedback sets
Extremal binary self-dual codes from a bordered four circulant construction
Dissections of p : q rectangles into 13 p : q rectangular elements
Partitions and well-coveredness: The graph sandwich problem
Linear transformations of monotone functions on the discrete cube
The set of types of a finitely generated variety
The enumeration of some restricted matrices
Chang's lemma via Pinsker's inequality
Orthogonal arrays obtained by repeating-column difference matrices
Solitary and edge-minimal bases for representations of the simple lie algebra G 2
An upper bound on the domination number of n-vertex connected cubic graphs
On a family of binary completely transitive codes with growing covering radius
Three ways to cover a graph
An improved condition for a family of trees being determined by their generalized spectrum
There is no universal countable random-free graph
On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles
On matching and total domination in graphs
The threshold for powers of tight Hamilton cycles in random hypergraphs
The list of chromatically unique graphs of order seven and eight
A class of ?-perfect graphs
Optimal factorizations of families of trees
Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most 3
The VC dimension of quadratic residues in finite fields
The Ramsey number of paths with respect to wheels
On a conjecture on total domination in claw-free cubic graphs
Some aspects of the information theoretic dialogue
A recursive method for construction of designs
Paths and cycles in extended and decomposable digraphs ,
Between clique-width and linear clique-width of bipartite graphs
On the representability of totally unimodular matrices on bidirected graphs
A counterexample to a conjecture of Erdõs
Completing the spectrum of r-orthogonal Latin squares
Bilateral inversions and terminating basic hypergeometric series identities
Sur la distribution de l'arité de la racine d'une arborescence hyperquaternaire à d dimensions
A generalized closure and complement phenomenon
Existence results for a fourth-order discrete boundary value problem with a parameter
More super p-groups
On pancyclic representable matroids
On a tiling conjecture of Komlo's for 3-chromatic graphs
The product of the independent domination numbers of a graph and its complement
Bijections for ternary trees and non-crossing trees
The existence of uniform hypergraphs for which the interpolation property of complete coloring fails
Generating strings for bipartite Steinhaus graphs
Spectral radius and [ a , b ]-factors in graphs
On the number of edges in graphs with a given connected domination number
Regular perfect systems of differences sets
A sufficient condition for complete multipartite graphs to be of Type 1
Constructing and deconstructing latin trades
Path-monochromatic bounded depth rooted trees in (random) tournaments
On optimal linear codes over F 5
Dense, irregular, yet always-graphic 3-uniform hypergraph degree sequences
Hamming weights in irreducible cyclic codes
A further construction of double diagonal orthogonal latin squares
Generalized Turán problems for double stars
An equivalence class decomposition of finite metric spaces via Gromov products
Two conjectures of Grünbaum on arrangements of curves
Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations
Color symmetry and group theory
Two new families of linear codes with five Lee-weights over Fq+uFq and their Gray images
Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
A note on 3-Steiner intervals and betweenness
Counting lattice paths in restricted planes
Dense maximal asymptotic nonbases of order two
A game of cops and robbers played on products of graphs
Equitable coloring in 1-planar graphs
f f-factors, complete-factors, and component-deleted subgraphs
Decomposition of 3-connected cubic graphs
Bartholdi zeta functions of line graphs and middle graphs of graph coverings
Chambers of wiring diagrams
The graphs that have antivoltages using groups of small order
Small cycle cover of 2-connected cubic graphs
Sharply 2-transitive groups of projectivities in generalized polygons
Matroids on convex geometries (cg-matroids)
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs
Embeddability of the combinohedron
Generation of 3-connected, planar line graphs
On the planarity of iterated jump graphs
Multi-Macdonald polynomials
The sum numbers and the integral sum numbers of the graph K n+1 \\E(K 1, r )
The Lovász-Cherkassky theorem for locally finite graphs with ends
On group divisible covering designs
Packing smaller graphs into a graph
Parametric Möbius inversion formulas
An infinite family of 7-designs
A LYM inequality for product measures
Some more properties of Catalan numbers
Irregularity strength of trees
Shortest single axioms for commutative moufang loops of exponent 3
Distance spectral radius of digraphs with given connectivity
On distinct distances and lambda-free point sets
Embedding a set of rational points in lower dimensions
A note on k-placeable graphs
Caps and Veronese varieties in projective Galois spaces
A lower bound on the size of (H; 1)-vertex stable graphs
On self-complementary strongly regular graphs
Characterization of subgroup perfect codes in Cayley graphs
Sur les fonctions de Bessel
Colorings and girth of oriented planar graphs
Some structural properties of planar graphs and their applications to 3-choosability
Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
Dependence systems with the operator-image exchange property
Tiling space with notched cubes
Towards the Chen-Raspaud conjecture
Elimination schemes and lattices
A note on roundedness in 4-connected matroids
Oriented hypergraphs: Balanceability
On the subgraphs of Cayley sum graphs
Embeddings of almost resolvable triple systems
Some new bounds on the spectral radius of graphs
A general homotopy complementation formula
Une note sur les contractions dans les polygones orthogonaux
(1, j)-set problem in graphs
Improved lower bound on the on-line chain partitioning of semi-orders with representation
Large monochromatic components in colorings of complete 3-uniform hypergraphs
Inequalities between the domination number and the chromatic number of a graph
Eccentricity and algebraic connectivity of graphs
Euclid and Wythoff games
Enumeration schemes for vincular patterns
TBSs in some minimum coverings
The fractional metric dimension of graphs
The enumeration of near-perfect matchings of factor-critical graphs
Kirkman's school projects
Recurrences for 2-colored and 3-colored F-partitions
Eulerian trace identities
Small values of the hyperbolicity constant in graphs
Constructing trees in bipartite graphs
The depth spectrums of constacyclic codes over finite chain rings
New spherical 4-designs
A new normal form of Boolean functions
Constructing flag-transitive, point-primitive 2-designs from complete graphs
On the cost-chromatic number of graphs
Generalized Schröder paths arising from a combinatorial interpretation of generalized Laurent bi-orthogonal polynomials
Latin Squares with Self-Orthogonal Conjugates
Further identities on Catalan numbers
On self-matching within integer part sequences
Two new optimal ternary two-weight codes and strongly regular graphs
Two observations concerning optimum cyclic burst-correcting codes
High girth and extendability
Solitary subgraphs of random graphs
Some Ramsey numbers for directed graphs
On weakly diamond-free Berge graphs
Construction of trees and graphs with equal domination parameters
Graphs and Hermitian matrices: Exact interlacing
Further results on higher weights of codes over finite rings
On lower bounds for the chromatic number in terms of vertex degree
Construction of new linear codes with good parameters from group rings and skew group rings
The maximum number of subset divisors of a given size
On the maximum number of distinct intersections in an intersecting family
Cubic semisymmetric graphs of order 6p 3
Chromatic polynomials and order ideals of monomials
On the ℓ -DLIPs of codes over finite commutative rings
On End-regular graphs
Orbit matrices of Hadamard matrices and related codes
Generalized 1-factorization of trees
Generating trees and proper Riordan Arrays
Triangulations
The inverse of circulant matrices over GF(2 m )
Noncrossing linked partitions and large (3, 2)-Motzkin paths
The average number of spanning hypertrees in sparse uniform hypergraphs
Finite linear spaces in which any n-gon is euclidean
Connectivity keeping caterpillars and spiders in 2-connected graphs
The q -log-concavity and unimodality of q -Kaplansky numbers
On the diameter of cut polytopes
On oriented path double covers
A recursive algorithm for trees and forests
Colouring triangle-free intersection graphs of boxes on the plane
A note on infinite transitive graphs
Beatty sequences and Langford sequences
Average running time analysis of an algorithm to calculate the size of the union of Cartesian products
Balanced group-labeled graphs
Characterization of the finite C-MH-homogeneous graphs
Some new combinatorial identities derived from units in algebraic number fields
Necklaces, symmetries and self-reciprocal polynomials
Some da capo directed power-sequence Z n+1 terraces with n an odd prime power
Antipodal distance-transitive covers with primitive quotient of diameter two
Super edge-magic strength of fire crackers, banana trees and unicyclic graphs
Independent coverings and orthogonal colourings
Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
A 40-dimensional extremal Type II lattice with no 4-frames
Sequences of integers with missing quotients and dense points without neighbors
Binary color-coded magic squares: A study of uniqueness under rotation/reflection, PCA, and LDA analysis
Chromatic equivalence classes of certain generalized polygon trees, III
A note on two conjectures of geller
On abelian closures of infinite non-binary words
Factors of trees
Linear and nonlinear constructions of DNA codes with Hamming distance 1-s2.0-S0012365X11005280-si18, constant GC-content and a reverse-complement constraint
More on almost self-complementary graphs
On the maximal length of a snake in hypercubes of small dimension
On graphic elementary lifts of graphic matroids
Estimation asymptotique de la distance minimale du dual des codes BCH et polynômes de Dickson
CT bursts - from classical to array coding
Conditional colorings of graphs
Diagonal poset Ramsey numbers
Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
Graphs without large triangle free subgraphs
Decomposition of some planar graphs into trees
Some relations between analytic and geometric properties of infinite graphs
Balanced graphs and noncovering graphs
On periodic properties of circular words
Remarks on the minus (signed) total domination in graphs
A Fisher type inequality
Classification of a family of symmetric graphs with complete 2-arc-transitive quotients
The Cameron-Erdös conjecture
On the spectrum of an extremal graph with four eigenvalues
A note on the minimum size of k-rainbow-connected graphs
Near-MDS codes over some small fields
On universal graphs for planar oriented graphs of a given girth
The core of a graph
Extremal k-edge-hamiltonian hypergraphs
More non-reconstructible hypergraphs
Subthrackleable graphs and four cycles
Minimum cost partitions of a rectangle
Completely separating systems of k-sets
Graphs whose every independent set has a common neighbour
Linear spaces with many small lines
Centralization of transmission in networks
Turán numbers of Berge trees
The Robinson-Schensted correspondence for skew oscillating semi-standard tableaux
Monochromatic k-edge-connection colorings of graphs
The total-chromatic number of some families of snarks
On codes meeting the Griesmer bound
A note on the total coloring of planar graphs without adjacent 4-cycles
On the chromatic number of special distance graphs
Some sequences of integers
Spectral characterization of mixed extensions of small graphs
A note on Berge-Fulkerson coloring
Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2
Vertices of degree 6 in a contraction critically 6-connected graph
Skew-morphisms of regular Cayley maps
A note on clique immersion of strong product graphs
1-Tough cocomparability graphs are hamiltonian
Stable dominating circuits in snarks
Some bounds for the b -chromatic number of a grap
On a representation of the Verhulst logistic map
On separating systems of graphs
Kernels of modular inclusion maps
Total monochromatic connection of graphs
Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
(k, g)-cages are 3-connected
Generalized perfect difference families and their application to variable-weight geometric orthogonal codes
On the smallest graphs of girth 10 and valency 3
The Hamiltonian index of graphs
α -Diperfect digraphs
Near-boolean algebras I: Combinatorial aspects
Extreme point programming with nonlinear constraints
The game L(d, 1)-labeling problem of graphs
An O(qn) algorithm to q-color a proper family of circular arcs
The oriented diameter of a bridgeless graph with the given path P
Double-critical graph conjecture for claw-free graphs
An extension of Zeilberger's fast algorithm to general holonomic functions
On covering intersecting set-systems by digraphs
Level sets in finite distributive lattices of breadth 3
Corners of (t,tk ± 1)-core partitions
An algorithmic method to compute plat slide moves in 3-manifolds of Heegaard genus two
The complexity of colouring by locally semicomplete digraphs
Switching classes of directed graphs and H-equivalent matrices
Proximity and remoteness in triangle-free and C 4 -free graphs in terms of order and minimum degree
On the structure of orthomodular posets
Erratum to "On the dimensions of the binary codes of a class of unitals" [Discrete Math. 309(2009) 570-575]
Reconstructing finite group actions and characters from subgroup information
Semi-total graph colourings, the beta parameter, and total chromatic number
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
Combinatorial triangulations of homology spheres