yusuke1997/dblp-id-title huggingface dataset:
The c-boomerang uniformity and c-boomerang spectrum of two classes of permutation polynomials over the finite field F2n
A classification of locally semicomplete digraphs
An algorithm for solving the jump number problem
About quasi-kernels in a digraph
Proof of the Alon-Yuster conjecture
Nontraceable detour graphs
Packings and coverings of lambda K v by k -circuits with one chord
Two hamilton cycles in bipartite reflective kneser graphs
Matching divisible designs with block size four
Halving Steiner 2-designs
The rate of growth of the minimum clique size of graphs of given order and chromatic number
Characterization of extremal graphs from Laplacian eigenvalues and the sum of powers of the Laplacian eigenvalues of graphs
Linear programs dependent on a single parameter
Connected graphs of genus g with complementary orbits
On the number of labeled acyclic digraphs
Some Howell designs of prime side
Combinatorial sums and finite differences
On the existence of integer relative Heffter arrays
A generalization of the Buckley-Osthus model for web graphs
Convergence of iterated clique graphs
The rank-generating functions of upho posets
Existence of Steiner quadruple systems with an almost spanning block design
Enumeration of (0, 1)-matrices avoiding some 2×2 matrices
Tableau algorithms defined naturally for pictures
Maximum induced matchings in graphs
The coordinate representation of a graph and n-universal graph of radius 1
A simpler formula for the number of diagonal inversions of an (m, n)-parking function and a returning fermionic formula
On a conjecture of H. Gupta
On quasiabelian Cayley graphs and graphical doubly regular representations
The Disjoint Domination Game
An infinite family of subcubic graphs with unbounded packing chromatic number
Coordinatization of B-matroids
Achromatic number of K 5 ? K n for large n
Ramsey numbers of large books and bipartite graphs with small bandwidth
A smallest irregular oriented graph containing a given diregular one
A characterization of strongly chordal graphs
On subsets of partial difference sets
Integral complete multipartite graphs K a 1 .p 1 , a 2 .p 2 , ..., a s .p s with s=5, 6
The HOMFLY polynomial of links in closed braid form
Research problems
Strongly regular graphs from differences of quadrics
Combinatorics of fully commutative involutions in classical Coxeter groups
Spectral radius of graphs forbidden C 7 or C6△
Directed complete bipartite graph decompositions: Indirect constructions
Algebraic and geometric multiplicities for some hypergraphs
Path extendability of claw-free graphs
On trees with real-rooted independence polynomial
2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18
A note on embedding graphs without short cycles
On bounds for codes over Frobenius rings under homogeneous weights
Bounds on total domination in claw-free cubic graphs
An analysis of the (colored cudes) 3 puzzle
Queens graphs
Sequence characterization of Riordan arrays
Greedy linear extensions with constraints
Polyhedral consequences of the amalgam operation
The tangent splash in PG(6, q)
Partition of a bipartite graph into cycles
On the existence of dense substructures in finite groups
Information sets in quadratic-residue codes
A note on perfect partial elimination
Pentavalent 2-regular core-free Cayley graphs
Measure preserving homomorphisms and independent sets in tensor graph powers
On deriving unitals
Zeta functions and complexities of middle graphs of semiregular bipartite graphs
Liftings of automorphisms of hypermaps
On adjacency-transitive graphs
Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable
Some topological properties of star graphs: The surface area and volume
Walkwise and admissible mappings between digraphs
Remarque sur le polytope des couplages d'edmonds
Uniformly resolvable three-wise balanced designs with block sizes four and six
The existence of 3 orthogonal partitioned incomplete Latin squares of type t n
Triangles in arrangements of lines
A bijective proof of the equation linking the Schro"der numbers, large and small
Nowhere-zero Z 3 -flows through Z 3 -connectivity
Chained permutations and alternating sign matrices - Inspired by three-person chess
Rainbow connection for some families of hypergraphs
On extremal graphs without compatible triangles or quadrilaterals
Almost controllable graphs and beyond
Partitioning points by parallel planes
Utilization of error correcting codes for data transmission simulations
On induced subgraphs with odd degrees
Acyclic orientations and chromatic generating functions
Extending partial systems of distinct representatives
Distance-based (and path-based) covering problems for graphs of given cyclomatic number
On some results of Takács in ballot problems
Constructing sparse Davenport-Schinzel sequences
Heavy fans, cycles and paths in weighted graphs of large connectivity
Nonconvex vertices of polyhedral 2-manifolds
On the number of n-plexes
Counting subgraphs a new approach to the Caccetta-Häggkvist conjecture
On coverings of infinite- dimentional metric spaces
The stabilizer of the Adelaide oval
Concerning the shape of a geometric lattice
Chromatic classes of 2-connected (n, n+4)-graphs with at least four triangles
Partial geometric difference sets and partial geometric difference families
The chromatic number of graphs which induce neither K 1, 3 nor K 5 -e
A complexity dichotomy for signed H-colouring
On graphs with a local hereditary property
Circular chromatic indices of even degree regular graphs
A contraction of square transversal designs
A nonuniform Littlewood-Offord inequality for all norms
"Dart calculus" of induced subsets
Improved square coloring of planar graphs
Locally finite graphs with ends: A topological approach, I. Basic theory
Laplacian eigenvalues and fixed size multisection
Directed strongly regular graphs with mu=lambda
On convex partitions of polygonal regions
Further results on irregular, critical perfect systems of difference sets II: systems without splits
The Laplacian spread of line graphs
Partition-induced natural dualities for varieties of pseudo- complemented distributive lattices
Triangles with restricted degrees of their boundary vertices in plane triangulations
On a class of point-reflection geometries
Generalized Latin squares and their defining sets
Decompositions of a rectangle into non-congruent rectangles of equal area
Triangle-free regular graphs
The cone of cyclic sieving phenomena
On the recurrence f m+1 =b m f m -f m-1 and applications
On the differences of the generalized factorials at an arbitrary point and their combinatorial applications
Group action approaches in Erdős quotient set problem
Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
The relationship between k-forcing and k-power domination
On Gallai's conjecture for graphs with maximum degree 6
Characterization of signed graphs which are cellularly embeddable in no more than one surface
Paintability of r-chromatic graphs
Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces
On a dependence relation in finite lattices
Planar graphs without adjacent cycles of length at most seven are 3-colorable
Max-cut in circulant graphs
The intersection problem for 2-(v, 5, 1) directed block designs
Graphes parfaitement ordonnables généralises
On 2-arc-transitive Cayley graphs of Abelian groups
Ménage numbers, bijections and P-recursiveness
Conditional and post algebra expressions
A quintessential proof of van der Waerden's theorem on arithmetic progressions
Exhaustive generation of 'Mrs. Perkins's quilt' square dissections for low orders
On the d-distance face chromatic number of plane graphs
Improper colorability of planar graphs without prescribed short cycles
Cyclic sieving of finite Grassmannians and flag varieties
A unified approach to complementarity in optimization
Flow number and circular flow number of signed cubic graphs
A result in asymmetric Euclidean Ramsey theory
Vertex cut, eigenvalues, [a,b]-factors and toughness of connected bipartite graphs
A walk-regular graph, cospectral to its complement, need not be strongly regular
Polarity graphs and Ramsey numbers for C 4 versus stars
A characterization of claw-free b-perfect graphs
On a strange observation in the theory of the dimer problem
Coloring Eulerian triangulations of the projective plane
Equivalence classes of Dyck paths modulo some statistics
Maximum packings with odd cycles
Constructions for orthogonal designs using signed group orthogonal designs
Solution to a question of A. Beutelspacher on finite linear spaces
Recursively decomposable well-covered graphs
Extremal edge problems for graphs with given hyperoctahedral automorphism group
We shall have to evolve problem solvers galore Since each problem we solve creates ten problems more
The vertex connectivity of a {0, 2}-graph equals its degree
Path-connectivity in local tournaments
Regular subsets in semi-direct products of monoids
A remark on infinite arithmetic progressions
K p, q -factorization of the complete bipartite graph K m, n
(r, r+1)-factorizations of (d, d+1)-graphs
A variation on a theme of Sylvester - a smoother road to Göllnitz's (Big) theorem
A Hopf algebra for counting cycles
Group distance magic Cartesian product of two cycles
On the null-homotopy of graphs
Integer-pair sequences with self-complementary realizations
On anti-magic labeling for graph products
Circumferences of regular claw-free graphs
On cross-intersecting families
Corrigendum to counting labeled claw-free cubic graphs by connectivity
On existence of perfect bitrades in Hamming graphs
Query complexity of mastermind variants
Three classes of linear codes with two or three weights
A note on the Newton radius
Loops and regions in Hitomezashi patterns
Generalized Wythoff arrays, shuffles and interspersions
On degrees of vertices in paradoxical trees
P4-comparability graphs
On distance two graphs of upper bound graphs
Locally finite graphs with ends: A topological approach, II. Applications
Minimal homogeneous latin trades
Kings in bipartite tournaments
Distribution of contractible elements in 2-connected matroids
The generating function of Whitworth runs
Generalized Davenport-Schinzel sequences with linear upper bound
On endo-Cayley digraphs: The hamiltonian property
Equitable vertex arboricity of graphs
Unipancyclic matroids
Majorization for partially ordered sets
Combinatorial problems in the theory of music
A Catalan triangle
Divisibility of certain coefficients of the chromatic polynomials
Tight single-change covering designs with v = 12, K = 4
Minimal reducible bounds in the lattice of additive hereditary graph properties
A note on the critical ideals of a cycle
K-loops derived from Frobenius groups
Set systems with positive intersection sizes
Partial orders and their convex subsets
On dominating pair degree conditions for hamiltonicity in balanced bipartite digraphs
Steep polyominoes, q-Motzkin numbers and q-Bessel functions
Some sequences associated with combinatorial structures
A family of self-orthogonal divisible codes with locality 2
Logarithmic behavior of some combinatorial sequences
On the enumeration of polyhedra
On well (edge) dominated and equimatchable strong product graphs
Genus bounds for embeddings with large minimum degree and representativity
Competition-reachability of a graph
Digraph functors which admit both left and right adjoints
Cycle-supermagic decompositions of complete multipartite graphs
Light graphs in families of outerplanar graphs
Asymptotic enumeration, global structure, and constrained evolution
Hermitian duality of left dihedral codes over finite fields
(s, m)-radius of k-connected graphs
Path transferability of graphs with bounded minimum degree
Descriptively sufficient subcollections of flats in matroids
Covering a cubic graph with perfect matchings
On a generalization of the Evans Conjecture
Fault-detection in networks
Tight blocking sets in some maximum packings of lambdaK n
Matroid inequalities
Interval group testing for consecutive positives
The mu-way intersection problem for m-cycle systems
Splitting property in infinite posets
On the decomposition dimension of trees
The domination game played on unions of graphs
On 2-arc-transitive representations of the groups of fourth-power-free order
The rigidity of the smallest unknown pi-space
On the maximum number of disjoint Steiner triple systems
On Seymour's Second Neighborhood conjecture of m-free digraphs
Z-knotted and Z-homogeneous triangulations of surfaces
Classical arcs in PG(r, q) for 11 <= q <= 19
A class of h-perfect graphs
Graphs determined by their Aα-spectra
Sylvester-type theorems for unit circles
Dissecting the square into seven or nine congruent parts
Chromatically unique graphs
Generalized partially balanced incomplete block designs : To: Kishore Sinha, Discrete Mathematics 67 (1987) 315-318
Intervals and steps in a connected graph
On kernel-perfect critical digraphs
The Ramsey numbers of wheels versus odd cycles
Generalized deviation of posets and modular lattices
Special parity of perfect matchings in bipartite graphs
Interleaving schemes on circulant graphs with two offsets
Regular sparse anti-magic squares with small odd densities
Local properties of Boolean functions II: isotony
Locating-paired-dominating sets in square grids
On minor-minimally-connected matroids
Edge-dominating cycles in graphs
Horn sentences in Post algebras
On rich and poor directions determined by a subset of a finite plane
Random packings of graphs
Twin Steiner triple systems
The number of Moore families on n =6
The intersection of all maximum stable sets of a tree and its pendant vertices
On matroids with many common bases
The representation number of some sparse graphs
On maximum matchings in almost regular graphs
Perfect zero-divisor graphs
On almost (k-1)-degenerate (k+1)-chromatic graphs and hypergraphs
Combinatorial analogs of topological zeta functions
Upper bounds for positive semidefinite propagation time
A tournament problem
A sufficient condition for graphs with large neighborhood unions to be traceable
Berge's theorem, fractional Helly, and art galleries
Lower bounds on the worst-case complexity of some oracle algorithms
Murnaghan-Nakayama rules for symplectic, orthogonal and orthosymplectic Schur functions
Cycle-factorization of symmetric complete multipartite digraphs
A revised Moore bound for mixed graphs
Minimum embedding of Steiner triple systems into (K 4 -e)-designs I
Flag-transitive point-primitive quasi-symmetric 2-designs with block intersection numbers 0 and y ≤ 10
Reductions of additive sets, sets of uniqueness and pyramids
On the maximum cardinality of binary constant weight codes with prescribed distance
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
On orbital regular graphs and frobenius graphs
A new family of optimal FHS sets with composite lengths
Transition operations over plane trees
On the spectral characterizations of ∞-graphs
Characterizing forbidden pairs for hamiltonian properties
On an inequality in probability
Comment on "The Steiner number of a graph" by G. Chartrand and P. Zhang: [Discrete Mathematics 242 (2002) 41-54]
Pattern avoidance on graphs
On finite additive complements
Intersections and supports of quadruple systems
A combinatorial proof of Newton's identities
Characterization of {2(q+1)+2, 2;t, q}-minihypers in PG(t, q) (t>=3, qepsilon{3, 4})
Traceability of k-traceable oriented graphs
On the size of maximal antichains and the number of pairwise disjoint maximal chains
Une nouvelle famille de 3-codes parfaits sur GF(q)
On multipartite posets
The induced path convexity, betweenness, and svelte graphs
Permutations ayant une forme donnee
Packing 1×2×4 bricks in a cubical box
Countable sequenceable groups
Size of monochromatic components in local edge colorings
Characterisation of potentially bipartite self-complementary bipartitioned sequences
Another cycle structure theorem for hamiltonian graphs
Greedy Loop Transversal Codes for Correcting Error Burst
A new construction of circulant GH(p 2 ;Z p )
Upper bounds for f-domination number of graphs ,
Application des fonctions symétriques à la résolution d'équations différentielles autonomes combinatoires
A theorem on associative block designs
Symmetric polynomials and Hall's theorem
Another proof of dilworth's decomposition theorem
Kirkman triple systems with subsystems
Maximizing the number of spanning trees in K n -complements of asteroidal graphs
A further extension of Yap's construction for ?-critical graphs
A note on the spectra of certain skew-symmetric {1, 0, -1}-matrices
Problems worthy of attack prove their worth by hitting back
Configurations and their realization
Clique-Stable Set separation in perfect graphs with no balanced skew-partitions
The spectrum of resolvable Bose triple systems
Spectral extrema of graphs: Forbidden hexagon
The enumeration of trees with and without given limbs
Extensions of barrier sets to nonzero roots of the matching polynomial
Problems and algorithms for covering arrays
Multicolored parallelisms of Hamiltonian cycles
The saturation number for unions of four cliques
e-Realization of double-stars
Universal tilings of the plane by 0-1-matrices
Is there a diagram invariant?
The firefighter problem for cubic graphs
Vertex-disjoint 4-cycles containing specified edges in a bipartite graph
Degree sums and subpancyclicity in line graphs
Research problems from the 19th British Combinatorial Conference
Finite invariant sets in infinite graphs
Segment representation of a subclass of co-planar graphs
New lower bounds on 2-spontaneous emission error designs
Sparse graphs with an independent or foresty minimum vertex cut
Bounds on the measurable chromatic number of R n
The weight distribution of irreducible cyclic codes with block lengths n 1 ((q 1 -1)/N)
Enumeration of vacuously transitive relations
Graph-theoretical conditions for inscribability and Delaunay realizability
Paul Catlin 1948-1995
Enumeration of platonic maps on the torus
Enumeration of rooted 4-regular maps without planar loops
On the sub-permutations of pattern avoiding permutations
Young tableaux and linear independence of standard monomials in multiminors of a multimatrix
Embedding Steiner triple systems into Steiner systems S (2, 4, v )
The coherency index
On subgroup regular sets in Cayley sum graphs
Recent work in matroid representation theory
Series-parallel graphs are windy postman perfect
Hexagonal polyomino achievement
The coarse geometry of Hartnell's firefighter problem on infinite graphs
On the Anderson-Lipman conjecture and some related problems
Average distance and generalised packing in graphs
Independence number of iterated line digraphs
Elements belonging to triads in 3-connected matroids
Monophonic numbers of the join and composition of connected graphs
Superconnectivity of bipartite digraphs and graphs
Graphs constructible from cycles and complete graphs
The symmetric representation of lines in PG(F3⊗F3)
Klein cordial trees and odd cyclic cordial friendship graphs
Rooted directed path graphs are leaf powers
On triangular biregular degree sequences
Lower bounds for bi-colored quaternary ramsey numbers
Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns
Analyzing Nash-Williams' partition theorem by means of ordinal types
An effective additive basis for the integers
Counting pairs of nonintersecting lattice paths with respect to weighted turns
Lower bounds for the domination number and the total domination number of direct product graphs
Ramsey goodness of fans
Maximum sparse induced subgraphs of the binomial random graph with given number of edges
Almost color-balanced perfect matchings in color-balanced complete graphs
A note on traversing specified vertices in graphs embedded with large representativity
Facial parity edge colouring of plane pseudographs
Perfectly orderable graphs are quasi-parity graphs: a short proof
On fillings of 2N-gons with rhombi
Pentavalent symmetric graphs of order twice a prime power
Classical partition functions and the U(n+1) Rogers-Selberg identity
On the existence of tight relative 2-designs on binary Hamming association schemes
Large Isaacs' graphs are maximally non- Hamilton-connected
On graphs with equal domination and independent domination numbers
Derivative polynomials and enumeration of permutations by number of interior and left peaks
R -annihilated and independent perfect neighborhood sets in chordal graphs
Three classes of propagation rules for generalized Reed-Solomon codes and their applications to EAQECCs
MV-algebras with operators (the commutative and the non-commutative case)
Vertex-disjoint double chorded cycles in bipartite graphs
A new technique for the characterization of graphs with a maximum number of spanning trees
Mass formulae for Euclidean self-orthogonal and self-dual codes over finite commutative chain rings
Graph partitions with minimum degree constraints
Semi Laguerre i-structures
Stable set meeting every longest path
Quasisymmetric and Schur expansions of cycle index polynomials
Cutting-plane theory: Algebraic methods
On Turán-good graphs
A criterion for primitive polynomials over Galois rings
Some codes related to BCH-codes of low dimension
Injective choosability of subcubic planar graphs with girth 6
An eigenvalue bound for the Laplacian of a graph
The irredundance number and maximum degree of a graph
The chromatic index of multigraphs that are nearly full
Explicit congruences for k-marked Durfee symbols
Comparability digraphs: An analogue of comparability graphs
On creating sets with large lower density
Classifying patterns by automorphism group: An operator theoretic approach
Tower diagrams and Pieri's rule
On 4-critical planar graphs with high edge density
Complements and transitive closures
Choosability of graphs with infinite sets of forbidden differences
Concerning the spectrum of perpendicular arrays of triple systems
Convex hull thrackles
Graph homotopy and Graham homotopy
Some bounds on the Laplacian eigenvalues of token graphs
Moments of normally distributed random matrices given by generating series for connection coefficients - Explicit algebraic computation
All graphs with maximum degree three whose complements have 4-cycle decompositions
On diameter perfect constant-weight ternary codes
The multiplicity of the two smallest distances among points
Endomorphism spectra of graphs
Ramsey numbers of several K t , s and a large K m , n
Locally trivial t-designs and t-designs without repeated blocks
On the colorings of outerplanar graphs
Characterization of diagrams by 0-1 inequalities
Bounds for the average genus of the vertex-amalgamation of graphs
Towards generalizing MacDougall's conjecture on vertex-magic total labelings
Four results about self-blocking clutters
Maximum vertex and face degree of oblique graphs
A class of constacyclic codes over F p +vF p and its Gray image
Finding Hamiltonian cycles in {quasi-claw, K 1, 5 , K 1, 5 +e}-free graphs with bounded Dilworth numbers
On extended 1-perfect bitrades
Supplementary difference sets and Jacobi sums
Decompositions of complete graphs into regular bichromatic factors
Research problems from the BCC22
Recognizing random intersection graphs
Edge coloring multigraphs without small dense subsets
The trace codes of several classes of linear codes
On matroid intersection adjacency
The smallest degree sum that yields potentially k C l -graphic sequences
Graph family operations
Enumeration of (k, 2)-noncrossing partitions
On covering and coloring problems for rook domains
A note on cycle spectra of line graphs
Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs
The elementary Abelian Steiner systems S(2, 4, 49)
A note on dominating sets and average distance
The autoconjugacy of the 3 x +1 function
Binary periodic sequences with 2-level autocorrelation values
The strong chromatic index of a class of graphs
A characterization of graphs with given maximum degree and smallest possible matching number: II
On 3-Steiner simplicial orderings
Covers of graphs and EGQs
Comparability graphs and intersection graphs