yusuke1997/dblp-id-title huggingface dataset:
Kernels in pretransitive digraphs
Total and fractional total colourings of circulant graphs
On incidence choosability of cubic graphs
Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs
Sets defining minimal vertex covers
Spanning trees with at most 4 leaves in K1, 5-free graphs
Compositions with restricted parts
Reconstruction of maximal outerplanar graphs
Subspace partitions of Fqn containing direct sums
Triple systems and binary operations
Some methods for computing component distribution probabilities in relational structures
Factorizations of root-based polynomial compositions
Non-central generalized q -factorial coefficients and q -Stirling numbers
Thresholds for families of multisets, with an application to graph pebbling
Extremal weight enumerators and ultraspherical polynomials
Toroidal tilings from de Bruijn-Good cyclic sequences
On a problem by Dol'nikov
Fibonacci numbers and words
On a problem of Erdös, Hajnal and Rado
H-triangles with k interior H-points
q, p-Analogue des nombres de Catalan
On group-divisible designs with block size four and group-type 6 u m 1
Sets in R d with no large empty convex subsets
On the roots of Wiener polynomials of graphs
Existence of DBIBDs with block size not divided by four
The achromatic number of bounded degree trees
Distance integral generalized wheel graphs
Binary cyclic codes from explicit polynomials over GF(2 m )
On the geodetic Radon number of grids
Some new quantum MDS codes from generalized Reed-Solomon codes
On the relations between certain graph labelings
The structure of strong arc-locally semicomplete digraphs
About the piercing number of a family of intervals
An algorithm for the rota straightening formula
Graph partition problems into cycles and paths
Injective colorings of sparse graphs
Further results on incomplete (3, 2, 1)- conjugate orthogonal idempotent Latin squares
Probabilistic averaging in bounded commutative residuated l -monoids
A bijection on Dyck paths and its consequences (note) [discrete math. 179 (1998) 253-256]
Extremal product-one free sequences over C n ⋊ s C 2
Groups which are isomorphic to a semigroup of a linear nonsingular subautomaton
On finding the eigenvalues of the matrix of rotation symmetric Boolean functions
Integral trees with diameters 5 and 6
Helly EPT graphs on bounded degree trees: Characterization and recognition
On binary reflected Gray codes and functions
On a question concerning prime distance graphs
Least domination in a graph
On connectivity of consecutive- d digraphs
There are no edge-chromatic 4-critical graphs of order 12
A cyclically 6-edge-connected snark of order 118
On deleting coordinates from integer vectors
Congruences involving Bernoulli polynomials
A classification of cubic s-regular graphs of order 14p
Dimension de krull des ensembles ordonnes
New large sets of resolvable Mendelsohn triple systems
The covering radius of the Reed-Muller code RM(2, 7) is 40
Inducibility of d-ary trees
The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
On sums of binomial coefficients and their applications
On the sizes of expander graphs and minimum distances of graph codes
The chairman assignment problem
Edge choosability of planar graphs without small cycles
On the Dinitz conjecture and related conjectures
Decompositions of signed-graphic matroids
Coloring arcs of convex sets
Automorphism groups with cyclic commutator subgroup and Hamilton cycles
An uncertainty inequality and zero subsums
Cuts leaving components of given minimum order
A short proof of Catlin's extension of Brooks' theorem
Binary contraction of graphs
On the largest eigenvalue of a tree with perfect matchings
Ramsey linear families and generalized subdivided graphs
Multicolor Ramsey numbers involving graphs with long suspended paths
Rectangular groupoids and related structures
Meet- and join-irreducibility of additive hereditary properties of graphs
Choosability conjectures and multicircuits
MGDD with block size 4 and its application to sampling designs
Two-color Rado number of x + y + c = kz for large c
Extremal self-dual codes with the smallest covering radius
Minimal strong digraphs
Extremal graphs for the distinguishing index
Factoring distance matrix polynomials
Switching of covering codes
Log-concavity and unimodality of compound polynomials
Covering algebras and q-binomial generating functions
Cyclotomic exponent sequences of numerical semigroups
Average distance in graphs and eigenvalues
Even pairs in Berge graphs with no balanced skew-partitions
Efron's coins and the Linial arrangement
Competitively orientable complete multipartite graphs
A 2n-Point interpolation formula with its applications to q-identities
The maximum product of sizes of cross-intersecting families
On colorings of graph fractional powers
Inductive classes of bipartite cubic graphs
Bandwidth of the strong product of two connected graphs
Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves
Corrigendum to "On even cycle decompositions of 4-regular line graphs" [Discrete Math. 313 (17) (2013) 1697-1699]
Chromatic numbers of spheres
Vertex-disjoint triangles in K 1, t -free graphs with minimum degree at least t
Separation of clones of cooperations by cohyperidentities
Chromatic equivalence classes of complete tripartite graphs
Reconstruction of sequences
Subgraphs of minimal degree k
New quantum MDS codes with large minimum distance and short length from generalized Reed-Solomon codes
The commutation graph for the longest signed permutation
Excessive near 1-factorizations
Application of hypergraph theory in chemistry
Extremal generalized hexagons and triple intersection numbers
5-Designs from the lifted Golay code over Z 4 via an Assmus-Mattson type approach
Sufficient conditions for closed-trailable in digraphs
Some extremal problems of graphs with local constraints
Ramsey goodness of paths versus unbalanced graphs
On theorems of Whitney and Tutte
Coloring directed hypergraphs
On the automorphism groups of Lunardon-Polverino scattered linear sets
Self-converse mixed graphs are extremely rare
On 2-walks in chordal planar graphs
Label-connected graphs and the gossip problem
Planar domination graphs
A study of the total chromatic number of equibipartite graphs
On the existence of uniformly resolvable decompositions of K v and K v - I -I into paths and kites
Distance constrained labelings of K 4 -minor free graphs
More examples on ordered set reconstruction
Automatic complexity of shift register sequences
On the rank of a matrix associated with a graph
Diameter bounds for planar graphs
Answer to some open questions on covering dimension for finite lattices
Optimal graphs for chromatic polynomials
On the domination number of generalized Petersen graphs P(n, 2)
The condition for a cyclic code to have a complementary dual
Localizing combinatorial properties of partitions
Characterization of graphs with infinite cyclic edge connectivity
Maximal graphs with respect to rank
An upper bound for orders of certain (k, k _ ))-connected graphs
A characterization of local regular languages
3-trees with few vertices of degree 3 in circuit graphs
Askey-Wilson relations and Leonard pairs
Stable matchings in three-sided systems with cyclic preferences
The matching polynomial of a regular graph
Another extremal problem for Turan graphs
Complementation in the lattice of equivalence relations
Characterization of graphs with equal domination and covering number
New bounds for the acyclic chromatic index
Non-trivial t-designs without repeated blocks exist for all t
Optimal realizations of two-dimensional, totally-decomposable metrics
A tripling construction for overlarge sets of KTS
Total dominating sequences in graphs
Random regular graphs of non-constant degree: Concentration of the chromatic number
Generating sets for lattices of dimension two
Perceptron order for cylindrical, polar, and spherical connectivity
On the Ramsey numbers of odd-linked double stars
A characterization of signed graphs with generalized perfect elimination orderings
On the simplicity of ·2 and ·3
An infinite series of resolution III.2 designs for the 2 m factorial experiment
Forbidden subgraphs and Hamiltonian properties of graphs
On the intersection of two S(3, 4, 2upsilon) having a same derived triple system
Generalized Latin squares on the torus
A class of BCH codes of length 2(q2m-1)q+1 and their duals
A short proof for a theorem of Harper about Hamming-spheres
The standard factorization of Lyndon words: an average point of view
On the Steenrod length of real projective spaces: finding longest chains in certain directed graphs
Kazhdan-Lusztig and R-polynomials from a combinatorial point of view
Distinguishing labeling of group actions
Fourier transform over semi-simple algebras and harmonic analysis for probabilistic algorithms
Domination graphs of regular tournaments
Invariant factors of graphs associated with hyperplane arrangements
On vertex-induced weighted Turán problems
Graphs which have n/2-minimal line-distinguishing colourings
Maximal volume enclosed by plates and proof of the chessboard conjecture
Rainbow connection of graphs with diameter 2
Spectral characterizations of tournaments
Transversals in uniform hypergraphs with property (7, 2)
Linear operators that strongly preserve graphical properties of matrices
Chain algebras
A lower bound for the energy of graphs in terms of the vertex cover number
Dot products in Fq3 and the Vapnik-Chervonenkis dimension
Hamilton surfaces for the complete even symmetric bipartite graph
Disjoint hamiltonian cycles in bipartite graphs
On k-independence in graphs with emphasis on trees
Shifted symmetric delta-vectors of convex polytopes
Vertex properties of maximum scattered linear sets of PG(1, qn)
Partitions of AG(4, 3) into maximal caps
Z-cyclic ordered triplewhist tournaments on p elements, where p=5 (mod 8)
Generalized hexagons and polar spaces
A generalization of Aztec diamond theorem, part II
The characteristic polynomials of subarrangements of Coxeter arrangements
A generalization of Larman-Rogers-Seidel's theorem
The strong game colouring number of directed graphs
Enumeration of hypergraphs
Tough graphs and hamiltonian circuits
Graph orientations with set connectivity requirements
The overpartition function modulo small powers of 2
On the common nature of spreads and pencils in PG(d, q)
Zeta functions of oriented line graphs of graph coverings
An identity of symmetry for the Bernoulli polynomials
Defending the Roman Empire from multiple attacks
Color-bounded hypergraphs, IV: Stable colorings of hypertrees
List r-hued chromatic number of graphs with bounded maximum average degrees
Constructions and bounds for (m, t)-splitting systems
On spherical codes generating the kissing number in dimensions 8 and 24
Localized version of hypergraph Erdős-Gallai Theorem
On doubly light triangles in plane graphs
More powerful closure operations on graphs
On S-cyclic steiner systems
On structure of cogroups
Bounds on Randic indices
A characterization of graphs of radius-r flip-width at most 2
An (F2,F6)-partition of planar graphs without cycles of length 4 and 6
Optimal pebbling of graphs
On the blocking sets in S(3, 6, 22) and S(4, 7, 23)
Lower bounds on the cover-index of a graph
An arithmetic of complete permutations with constraints, I: an exposition of the general theory
A projective plane is an outstanding 2-cover
Nowhere-zero flows on tensor products of signed graphs
Quelques proprietes des ensembles de fermetures sur un ensemble ordonne
Strongly adjacency-transitive graphs and uniquely shift-transitive graphs
Factorials and stirling numbers in the algebra of formal Laurent series
A characterization of planar partial cubes
On the precise number of (0, 1)-matrices in U(R, R)
Tightness problems in the plane
Group divisible designs with block size 4 where the group sizes are congruent to 2 mod 3
Query complexity of Boolean functions on slices
Hamiltonian paths and hamiltonian connectivity in graphs
Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths
On finding the largest minimum distance of locally recoverable codes: A graph theory approach
Overlarge sets of resolvable idempotent quasigroups
On extendability of Deza graphs with diameter 2
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
Polynômes de Schubert Une approche historique
2-perfect m-cycle systems
A bound for the Dilworth number
Minors of quasi 4-connected graphs
Hyperplanes of D W (5, K ) containing a quad
Q-Ramsey classes of graphs
A recognition algorithm for the intersection graphs of directed paths in directed trees
Total chromatic number of graphs of odd order and high degree
Results on rotation symmetric bent functions
The minimum size of graphs hamiltonian-connected from a vertex
Research problems on Gray codes and universal cycles
All Ramsey numbers for cycles in graphs
Energy and inertia of the eccentricity matrix of coalescence of graphs
On the simple connectedness of hyperplane complements in dual polar spaces, II
The geometry of Boolean space and its elementary figures 1
Balanced pairs in partial orders
How colorful the signed graph?
Worst case asymptotics of power-weighted Euclidean functionals
On the problem of a matching orthogonal to a 2-factorization
Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph
On Beck's coloring of posets
The Saxl conjecture and the dominance order
Graeco-Latin squares with embedded balanced superimpositions of Youden squares
The chromaticity of wheels with a missing spoke II
Extending kernel perfect digraphs to kernel perfect critical digraphs
Characteristic polynomials of some graph coverings
On the distribution of eigenvalues of graphs
One-generator quasi-cyclic codes and their dual codes
Interval edge-colorings of complete graphs and n-dimensional cubes
Enumeration of row-increasing tableaux of two-row skew shapes
Constructing and classifying neighborhood anti-Sperner graphs
Embeddable transversal designs
Bruen chains over fields of small order
Classifications of finite highly transitive dimensional linear spaces
Properties of vertex cover obstructions
Integral complete 4-partite graphs
Planar graphs without intersecting 5-cycles are 4-choosable
Partition the vertices of a graph into induced matchings
4 2 -Decomposable super-simple ( v , 4, 8)-BIBDs
On 4-isomorphisms of graphs
Simple 3-polytopal graphs with edges of only two types and shortness coefficients
Fully gated graphs: Recognition and convex operations
Direct decompositions of non-algebraic complete lattices
Solving systems of arbitrary equations
Some bounds on the neighbor-distinguishing index of graphs
Some results and approaches for reconstruction conjectures
Structure of 4-connected claw-free graphs not containing a subdivision of K 5
Vertex heaviest paths and cycles in quasi-transitive digraphs
Problems on cycles and colorings
A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!)
On problems and conjectures on adjointly equivalent graphs
On balanced (Z4u×Z8v, {4, 5}, 1) difference packings
Domination number and neighbourhood conditions
A lower bound for v in a t - (v, k, λ) design
A result on C 4 -star Ramsey numbers
On forcibly connected graphic sequences
On kernels and semikernels of digraphs
A new sieve for restricted multiset counting
The unique symmetric block design (61, 16, 4) admitting an automorphism of order 15 operating standardly
q -Pell sequences and two identities of V.A. Lebesgue
On a restricted m -ary partition function
Packing two copies of a tree into its fourth power
On the cut-complexes of the 5-cube
Ferrers digraphs and threshold graphs
Chordal characterization of graphic matroids
On the asymptotic behavior of graphs determined by their generalized spectra
Some results related to the toughness of 3-domination critical graphs
A pair of orthogonal Steiner systems S(3, 5, 17)
Ramsey number of paths and connected matchings in Ore-type host graphs
On the minimum real roots of the adjoint polynomial of a graph
Asymptotic values of the Hall-ratio for graph powers
A note on a Caro-Wei bound for the bipartite independence number in graphs
On the fixed points of an automorphism of a symmetric design
Convexity of minimal dominating functions of trees - II
A sufficient condition guaranteeing large cycles in graphs
On cycles and paths in digraphs
Toughness condition for the existence of all fractional (a, b, k)-critical graphs
Exact rainbow numbers for matchings in plane triangulations
Optimal self-dual codes over Z 4
Cops and robber on subclasses of P 5 -free graphs
A branch-and-cut approach for minimum cost multi-level network design
Hamiltonian cycles in regular 3-connected claw-free graphs
On a problem of L. Fejes Tóth
A sufficient condition for equitable edge-colourings of simple graphs
k-kernels in k-transitive and k-quasi-transitive digraphs
On the spectrum of the sizes of semiovals in PG(2, q), q odd
Resolvable perfect Mendelsohn designs with block size five
Existence of self-orthogonal diagonal Latin squares with a missing subsquare
Large sets of resolvable idempotent Latin squares
Hamiltonian circuits in certain prisms
Low minor faces in 3-polytopes
The weight spectrum of two families of Reed-Muller codes
On generalized Frame-Stewart numbers
Graphical cyclic permutation groups
Null decomposition of trees
Coloring the complements of intersection graphs of geometric figures
A classification of finite {n-2, n}-biregular spaces
Sur les graphes infinis possedant un groupe d'automorphismes primitif
Spectra, Euclidean representations and clusterings of hypergraphs
Board games, random boards and long boards
The proof of, and generalisations to, a conjecture by Baker and Essam
Bisection of trees and sequences
Perfect colorings of transitive tilings and patterns in the plane
The r-complete partitions
Analogues of eberhard's theorem for 4-valent 3-polytopes with involutory automorphisms
On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties
Extremal spectral results related to spanning trees of signed complete graphs
On Whitney numbers of the order ideals of generalized fences and crowns
Restricted domination in graphs with minimum degree 2
Riordan arrays and combinatorial sums
Affine and projective planes
Chromatic roots and limits of dense graphs
Reconstructing sequences
Weighted Davenport's constant and the weighted EGZ Theorem
Observations on the construction of covers using permutation voltage assignments
One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial
Formal rational fractions and random walks on cycles
On the number of rational points on codimension-1 algebraic sets in P n (F q )
A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs
On factorial properties of chordal bipartite graphs
Constructing balanced 2p-variable rotation symmetric Boolean functions with optimal algebraic immunity, high nonlinearity and high algebraic degree
Indecomposability graph and critical vertices of an indecomposable graph
A classification of 2-arc-transitive circulant digraphs
On k-partite hypergraphs with the induced epsilon-density property
The numbers game and coxeter groups
Invariant subgraph properties in pseudo-modular graphs
On 3-connected matroids
A bijection on Dyck paths and its consequences
Connectivity of the uniform random intersection graph
Recent developments in total colouring
Local boxicity and maximum degree
The addition game: an abstraction of a communication problem
Unary operations with long pre-periods
Characterizing minimally n-extendable bipartite graphs
An algorithm for computing plethysm coefficients
On r-hued coloring of K 4 -minor free graphs
Partitioning Boolean lattices into antichains
On the spectral Ádám property for circulant graphs
Coverings and homotopy of a graph
On c-Bhaskar Rao Designs and tight embeddings for path designs
Plane triangulations are 6-partitionable
Graphical characterization of positive definite non symmetric quasi-Cartan matrices
On Boolean primitive positive clones
On non-strong jumping numbers and density structures of hypergraphs
Graphs with maximum average degree less than 114 are (1, 3)-choosable
The characterization of the lower bound on the dissociation number of trees
Decomposition of K 13 into a torus graph and a graph imbedded in the Klein bottle
A general construction for group-divisible designs
On the superconnectivity of generalized p -cycles
On the cycle space of graphs
Multicover Ucycles
Hamiltonian cycles with all small even chords
Tiling complexity of small n-ominoes (N < 10)
A few more r -orthogonal latin squares
Noisy random graphs and their Laplacians
The jump number and the lattice of maximal antichains
Existence of some signed magic arrays
Distance two labelling and direct products of graphs
Rectangles as sums of squares
On 4-connected 4-regular graphs without even cycle decompositions
Lattice of subalgebras in the finitely generated varieties of MV-algebras
On the number of occurrences of the kth smallest distance between points in convex position
More on halving the complete designs
Spanning subgraphs with specified valencies
(1, 1, 0)-coloring of planar graphs without cycles of length 4 and 6
Planar and infinite hypohamiltonian and hypotraceable graphs
Characterising clique convergence for locally cyclic graphs of minimum degree δ ≥ 6
On automorphisms of Cayley-digraphs of abelian groups
On decomposability of 4-ary distance 2 MDS codes, double-codes, and n-quasigroups of order 4
The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs
Relations between the lower domination parameters and the chromatic number of a graph
Non-Hamiltonian non-Grinbergian graphs
Limit points for the spectral radii of signed graphs
The (3,3)-colorability of planar graphs without 4-cycles and 5-cycles
Domination dot-critical graphs
Skolem labelled graphs
Some coefficients in the center of the group algebra of the symmetric group
Minimizing the least eigenvalue of graphs with fixed order and size
Erratum to: "Local edge domination critical graphs" [Discrete Mathematics 161 (1996) 175-184]
Labelings of Lee and Hamming spaces
On edge-weighted recursive trees and inversions in random permutations
On random models of finite power and monadic logic
Kruskal-Katona function and variants of cross-intersecting antichains
Upper minus total domination in small-degree regular graphs
Homomorphisms and colourings of oriented graphs: An updated survey
Vertex-transitive maps with Schläfli type {3, 7}
On k-caps in PG(n, q), with q even and n≥4
Bounds for the covering number of a graph
A proof of the symmetric theta trees conjecture when q = 0
Sloane's box stacking problem
Note on the Ahlswede-Daykin inequality
The edge-Wiener index of a graph
Penrose patterns are almost entirely determined by two points
Two kinds of hook length formulas for complete m-ary trees
Digraphs on permutations
Transformations of edge-colourings of cubic graphs
On acyclic edge coloring of planar graphs without intersecting triangles
Nowhere-zero 4-flows and cycle double covers
Classification of perfect linear codes with crown poset structure
Arrangements of planes in space
A characterization of interval catch digraphs
Matrices and set differences
Homomorphisms of binary Cayley graphs
Bipartite rainbow Ramsey numbers
Enumerating branched orientable surface coverings over a non-orientable surface
Graphic sequences with a realization containing a complete multipartite subgraph
Determination of the sizes of optimal ( m , n , k , λ , k -1)-OOSPCs for λ = k -1, k
1-factorizing regular graphs of high degree - an improved bound
Oriented two-dimensional circuits
Sufficient conditions for a planar graph to be list edge Δ -colorable and list totally ( Δ +1)-colorable
Examples of groups which have a graphical regular representation
Classification of (16, 6, 2)-designs by ovals
Interval-regular graphs
Constructions of non-principal families in extremal hypergraph theory
On representations of a number as a sum of three squares
On two unimodal descent polynomials