yusuke1997/dblp-id-title huggingface dataset:
Relating edge-coverings to the classification of ℤ 2 k -magic graphs
Traceability of line graphs
Tiling with notched cubes
Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs
Closed trail decompositions of some classes of regular graphs
Upper bounds for constant weight error correcting codes
Degree condition and Z 3 -connectivity
The geometry of the binomial array modulo p 2 and p 3
Chain polynomials of graphs
A new statistic on Dyck paths for counting 3-dimensional Catalan words
The diameter of protean graphs
Enumeration of Cayley graphs and digraph
Cycle bases from orderings and coverings
Short cycles in digraphs
Value functions and two classes of binary codes
R-sequenceability and R * -sequenceability of abelian 2-groups
More on Schmidt's partition theorem
The interval function of a connected graph and road systems
Unit disk graphs
On certain convex matrix sets
Openly disjoint circuits through a vertex in regular digraphs
Le treillis des chemins de Delannoy
Values and bounds for Ramsey numbers associated with polynomial iteration
End-faithful forests and spanning trees in infinite graphs
A projection property for buildings
On the number of non-critical vertices in strong tournaments of order N with minimum out-degree delta + and in-degree delta -
Disjoint properly colored cycles in edge-colored complete bipartite graphs
Two sufficient conditions for a planar graph to be list vertex-2-arborable
System of equations related to the existence conditions for arrays
Permutation graphs: Connected domination and Steiner trees
Zero-sum flows for Steiner systems
lambda-backbone colorings along pairwise disjoint stars and matchings
On a composition of cyclic 2-designs
Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices
A degree condition for diameter two orientability of graphs
Counting orbits of a product of permutations
On the span in channel assignment problems: bounds, computing and counting
Size in maximal triangle-free graphs and minimal graphs of diameter 2
A general Hungarian method for the algebraic transportation problem
The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
Waiter-Client clique-factor game
Hamiltonicity of tree-like graphs
Graphic vertices of the metric polytope
On the extendability of certain semi-Cayley graphs of finite abelian groups
How fast can Maker win in fair biased games?
On the upper bound of the diameter of interchange graphs
Linear codes of larger lengths with Galois hulls of arbitrary dimensions and related entanglement-assisted quantum error-correcting codes
The signed-graphic representations of wheels and whirls
Circulant digraphs determined by their spectra
Contributions to the theory of graphic sequences
Erratum to "Forbidden pairs for spanning (closed) trails" [Discrete Math. 340 (2017) 1012-1018]
Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs
On the bandwidth of convex triangulation meshes
On the second immanantal polynomials of graphs
Hermitian adjacency matrices with at most three distinct eigenvalues
A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern
Short cycles in mediate graphs
Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
Another variation on the common subexpression problem
On Sabidussi-Fawcett subdirect representation
Cubicity of threshold graphs
Permutation polynomials with Carlitz rank 2
On two determinants with interesting factorizations
On the hamiltonian index of a graph
A characterization of inverse relations
Well-graded spaces of valued sets
Gray code for permutations with a fixed number of cycles
Matching and edge-connectivity in graphs with given maximum degree
Degree sum conditions for the circumference of 4-connected graphs
Perfect dexagon triple systems with given subsystems
Dual pairs of non-polytopal diagrams and spheres
On the minimum average distance of binary constant weight codes
A generalisation of t-designs
Fast Hensel's lifting implementation using partial fraction decomposition
On a paper of Agur, Fraenkel and Klein
Boundary graphs - II The limit case of a spectral property
Stochastic tensors and approximate symmetry
Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdös condition approach
Formal series over sorted algebras
A generalization of the binomial coefficients
Compatibly ordered- OSTS of order n and compatibly ordered- OGDD of type h n for n =6 k +1
Highly-connected planar cubic graphs with few or many Hamilton cycles
Some more notions of homomorphism-homogeneity
Almost perfect matchings in random uniform hypergraphs
A conjecture of a basis for the diagonal harmonic alternants
A rainbow about T-colorings for complete graphs
Graphs with n-1 main eigenvalues
Further results on (v, {5, w * }, 1)-PBDs
Induced designs and fixed points
Solution of two fractional packing problems of Lovász
Limit shape of convex lattice polygons having the minimal L infinity diameter w.r.t. the number of their vertices
A note on linear complementary pairs of group codes
The metric dimension of Cayley digraphs
Some results on (a: b)-choosability
Classification of weighing matrices of order 13 and weight 9
The major index polynomial for conjugacy classes of permutations
On the independence number of the strong product of cycle-powers
Self-converse large sets of pure directed triple systems
Generalized symmetry of graphs - A survey
Type II codes over F 2 m +uF 2 m
Small solutions of linear Diophantine equations
Patterson-Wiedemann construction revisited
5-Chromatic even triangulations on surfaces
The Yang-Baxter equation, symmetric functions, and Schubert polynomials
Divisor matrices and magic sequences
Growing perfect cubes
Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
f-vectors of pure complexes and pure multicomplexes of rank three
Chromatic numbers and products
Probabilistic constructions in generalized quadrangles
Quadruple systems containing AG(3, 2)
Semirigid sets of diamond orders
Vertex pancyclicity in quasi claw-free graphs
Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane
Characterizations and properties of good eggs in PG(4 n -1, q ), q odd
Forbidden subsequences and Chebyshev polynomials
Shortest prefix strings containing all subset permutations
Maximal independent sets in graphs with a given matching number
Chebyshev action on finite fields
Connectedness in transfinite graphs and the existence and uniqueness of node voltages
The excess of Hadamard matrices and optimal designs
Combinatoric enumeration of two-dimensional proper arrays
The degree of the eigenvalues of generalized Moore geometries
Partial packing coloring and quasi-packing coloring of the triangular grid
Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
A new characterization of equipartite graphs
The place of super edge-magic labelings among other classes of labelings
On the existence of U-polygons of class c>=4 in planar point sets
Explicit factors of generalized cyclotomic polynomials and generalized Dickson polynomials of order 2m3 over finite fields
Lee metric codes for symbol-pair read channels
The evolution of the min-min random graph process
Generalized Cayley maps and Hamiltonian maps of complete graphs
On log concave sequences
On the number of 2-packings in a connected graph
n-Dimensional line graphs
The existence of Schröder designs with equal-sized holes
Isomorphic factorization of de Bruijn digraphs
Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
Coloring factors of substitutive infinite words
An identity involving 3-regular graphs
Janko sporadic group J2 as automorphism group of 3-designs
A classification of flag-transitive 2-designs with λ≥(r, λ) 2 and sporadic socle
On minimally t-tough graphs with t ≤ 1
A note on Abel polynomials and rooted labeled forests
Graphs whose complement and square are isomorphic
The distinguishing number of the augmented cube and hypercube powers
Survey of results on k-ordered graphs
An altered four circulant construction for self-dual codes from group rings and new extremal binary self-dual codes I
Frame patterns in n-cycles
Orthogonal representations of Steiner triple system incidence graphs
Partitioning a graph into two pieces, each isomorphic to the other or to its complement
The determinant of the adjacency matrix of a quaternion unit gain graph
Adams operations and lambda-operations in beta-rings
Some classes of strongly perfect graphs
Cubic graphs whose average number of regions is small
The minimum number of edges in a vertex diameter-2-critical graph
An upper bound for the Hamiltonicity exponent of finite digraphs
A spectral stability result regarding the complete bipartite graph K2,
Equitable list coloring of planar graphs without 4- and 6-cycles
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
Multinomial convolution polynomials
Short proof that Kneser graphs are Hamiltonian for n ⩾ 4 k
Almost all Cayley graphs have diameter 2
Series-parallel posets and the Tutte polynomial
Some characterizations of the exceptional planar embedding of I
Embedding partial bipartite directed cycle systems
The spectrum for self-converse large set of pure Mendelsohn triple systems
Clique-width of partner-limited graphs
On the length of the tail of a vector space partition
Ends in digraphs
The (t)-property of some classes of graphs
Random matroids
On regular association schemes of order pq
On graphs with maximum difference between game chromatic number and chromatic number
Cubic (m, n)-metacirculant graphs which are not Cayley graphs
A counterexample on contractible transformations on graphs
Matroids and antimatroids - a survey
Pebble game algorithms and sparse graphs
On the evolution of a random tournament
Shadow-boundaries of convex bodies
The number of spanning forests of a graph
The 3x+1 problem: new lower bounds on nontrivial cycle lengths
On the closure of graphs under substitution
The polytopal structure of the tight-span of a totally split-decomposable metric
One-factors and the existence of affine designs
Graph-like combinatorial structures in (r, 1)-designs
A new method of proving theorems on chromatic index
Acyclicity in edge-colored graphs
Approximately strongly regular graphs
On the complexity of H-colouring planar graphs
Edge-disjoint spanners of complete bipartite graphs
Existence status of some previously open abelian difference sets
Sums of powers of the degrees of a graph
Improving bounds on the diameter of a polyhedron in high dimensions
A problem on algebraic graph theory
The real symmetric matrices with a given rank and a P-set with maximum size
Sums of lexicographically ordered sets
Sandwich semigroups of binary relations
Four-dimensional football, fullerenes and diagram geometry
Weak degeneracy of regular graphs
The dichromatic number of digraphs without induced subdigraphs
On the existence of super edge-connected graphs with prescribed degrees
Automorphism groups of graphs with 1-factorizations
A generalization of the Erdős-Ko-Rado theorem to t-designs in certain semilattices
Bipartite tolerance orders
Isomorphism of circulant graphs and digraphs
Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
A Brylawski decomposition for finite ordered sets
Regular maps from Cayley graphs III: t-balanced Cayley maps
Graphs with average labellings
A simple combinatorial interpretation of certain generalized Bell and Stirling numbers
The thickness and chromatic number of r-inflated graphs
An extension of an inequality by Ahlswede, El Gamal and pang for pairs of binary codes
Extendability of quaternary linear codes
Identities on Bell polynomials and Sheffer sequences
On the covering radius of Reed-Muller codes
Nordhaus-Gaddum bounds for independent domination
New upper bounds for binary covering codes
q-ary (1,k)-overlap-free codes with given restrictions
A lower estimate for the achromatic number of irreducible graphs
Multiple roots of diagonal multiples of a square matrix
Corrigendum to "Colorings and spectral radius of digraphs" [Discrete Math. 339 (1) (2016) 327-332]
On arrays with some combinatorial structure
On the sum-of-ranks winner when losers are removed
Parametrizing the abstract Ellentuck theorem
On upper bound graphs whose complements are also upper bound graphs
A local density condition for triangles
Cube intersection concepts in median graphs
Sorted and/or sortable permutations
Large values of the clustering coefficient
An infinite family of integral graphs
The Pace code, the Mathieu group M 12 and the small Witt design S(5, 6, 12)
Some properties of 3-domination-critical graphs
An extension of Wagner's theorem
Distance magic labelings of Cartesian products of cycles
Factorization of composed polynomials and applications
The Universal Embedding Dimension of the Binary Symplectic Dual Polar Space
Two algorithms for matroids
Similar constructions for young tableaux and involutions, and their application to shiftable tableaux
Hamiltonian cycles in 4-connected plane triangulations with few 4-separators
Arbitrarily large difference between d d-strong chromatic index and its trivial lower bound
Partitions which are simultaneously t 1 - and t 2 -core
Interval competition graphs of symmetric diagraphs
A note on X¯-coloring and Aˆ-coloring 4-regular graphs
The galaxies of nonstandard enlargements of infinite and transfinite graphs
On subgraphs of tripartite graphs
The r-depth of a matroid
3-Restricted arc connectivity of digraphs
A kind of binomial identity
Stabilizers of consistent walks
Torrence D. Parsons : In memory of Torrence D. Parsons
Edge colorings of K 2n with a prescribed condition - I
A note on randomized Shepp's urn scheme
A universal partition result for infinite homogeneous Kn-free and related graphs
Long cycles in bipartite tournaments
Equality of distance packing numbers
Multicolored forests in complete bipartite graphs
On the seven non-isomorphic solutions of the fifteen schoolgirl problem
An extension of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences
A few more RBIBDs with k = 5 and lambda = 1
Line-critical point determining and point distinguishing graphs
Pair covering designs with block size 5
Splitness of the Veronesean and the Taniguchi dual hyperovals
The smallest order variety containing all chains
Super connectivity of Kronecker product of complete bipartite graphs and complete graphs
Excluded minors for Boolean polymatroids
Counting enriched multigraphs according to the number of their edges (or arcs)
A combinatorial mathematician in Norway: some personal reflections
On fractional multicommodity flows and distance functions
New values for the bipartite Ramsey number of the four-cycle versus stars
Spanning trees and spanning closed walks with small degrees
On Blecher and Knopfmacher's fixed points for integer partitions
On the sum of distances along a circle
An isoperimetric inequality in the universal cover of the punctured plane
Optimal linear rate 1/2 codes over F 5 and F 2
The maximum genus of graphs of diameter two
Neighborhood unions and extremal spanning trees
Enumeration of (uni- or bicolored) plane trees according to their degree distribution
Relaxed equitable colorings of planar graphs with girth at least 8
A characterization of the external lines of a hyperoval in PG(3, q), q even
Graph properties and hypergraph colourings
q-distributions and Markov processes
A determinant for q-counting n-dimensional lattice paths
Critical groups of covering, voltage and signed graphs
Latin cubes of order >=5
Improved bounds on the chromatic number of ( P 5 , flag)-free graphs
To: J.M. van den Akker, J.H. Koolen and R.J.M. Vaessens, "Perfect codes with distinct protective radii", Discrete Mathematics 81 (1990) 103-109
A local-global principle for vertex-isoperimetric problems
On chordal proper circular arc graphs
The number of the non-full-rank Steiner quadruple systems S(v, 4, 3)
A randomized algorithm for k-colorability
The d-precoloring problem for k-degenerate graphs
The clique number and the smallest Q-eigenvalue of graphs
Existence of resolvable BIBDs with k = 5 and lambda = 4
A generalisation of matching and colouring
Counting ordered graphs that avoid certain subgraphs
Gray codes for signed involutions
The planar Turán number of double star S2,4
An extension of the codes introduced by Séguin, allard and Bhargava
On 3-regular digraphs of girth 4
m-ary partitions with no gaps: A characterization modulo m
Sparse graph certificates for mixed connectivity
Fixed points of induced automorphisms of hypermaps
Factorizations of large cycles in the symmetric group
An algorithm for the number of path homomorphisms
Simultaneous representations of groups
Domination and irredundance in the queens' graph
On the uniqueness of a regular thin near octagon on 288 vertices (or the semibiplane belonging to the Mathieu group M 12 )
A remark on maximum matching of line graphs
Rooted minor problems in highly connected graphs
Determination of the distance-regular graphs without 3-claws
Disjoint odd integer subsets having a constant even sum
Adjacency posets of outerplanar graphs
Necessary Conditions for Hamiltonian Split Graphs
Graphs with the n-e.c. adjacency property constructed from affine planes
On minimally circular-imperfect graphs
The number of connected sparsely edged uniform hypergraphs
How many contacts can exist between oriented squares of various sizes?
An extremal problem on the potentially P k -graphic sequences
Double loop networks with minimum delay
Some structural properties of minimally contraction-critically 5-connected graphs
Convexity and fixed-point properties in Helly graphs
The Ramsey number R(C 8 , K 8 )
A new result on the problem of Buratti, Horak and Rosa
Periodic points of consecutive-pattern-avoiding stack-sorting maps
Kernels and perfectness in arc-local tournament digraphs
Improved FPT algorithms for weighted independent set in bull-free graphs
Maximizing the expected number of components in an online search of a graph
Corrigendum to: "Mass formulae for Euclidean self-orthogonal and self-dual codes over finite commutative chain rings" [Discrete Math. 344 (1) (2021) 112152]
Matroid representations by partitions
Enumeration of unlabelled graphs with specified degree parities
A computer search for finite projective planes of order 9
A pipeline-interval-optimum systolic queue
Extremal problems and generalized degrees
On the number of induced subgraphs of trees
On transversals in minimal imperfect graphs
Clique partitions and clique coverings
A generalization of the pentomino exclusion problem: Dislocation of graphs
Balls, bins, and embeddings of partial k-star designs
Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs
Cones from maximum h -scattered linear sets and a stability result for cylinders from hyperovals
On the fractional chromatic number of monotone self-dual Boolean functions
Spectra of toroidal graphs
Brun expansions of stepped surfaces
Multivariate matching polynomials of cyclically labelled graphs
Complementary bases of a matroid
Greedily constructing maximal partial f-factors
Enumeration of finite field labels on graphs
Strongly sufficient sets and the distribution of arithmetic sequences in the 3x+1 graph
Reconstructibility versus edge reconstructibility of infinite graphs
On forcibly hereditary p-graphical sequences
Toroidal maps of modular quotient groups
Towards a solution of the dinitz problem?
A note on Hamiltonian cycles in bipartite plane cubic maps having connectivity 2
A sufficient condition for dominating cycles
Nonadditivity of the 1-genus of a graph
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
Secret-sharing matroids need not be algebraic
Construction of caps by means of caps in complementary subspaces
A class of graphs with large rankwidth
On monomial codes in modular group algebras
Configurations in projective planes and quadrilateral-star Ramsey numbers
Linear codes over finite rings are trace codes
A note on cyclic almost difference families
On commutativity of two unary digraph operations: Subdividing and line-digraphing
Choice number of 3-colorable elementary graphs
The partite construction and ramsey set systems
Unimodality of Gaussian polynomials
On the family of r-regular graphs with Grundy number r+1
Nearly perfect binary codes
The existence of resolvable BIBD with k even and lambda=1
On approximating the rank of graph divisors
Edge-choosability in line-perfect multigraphs
On the complexity of all (g, f)-factors problem
Exact generalized Turán numbers for even linear forests
Partitioning twofold triple systems into complete arcs
On the domination number of a graph
The existence of uniquely -G colourable graphs
On chromatic roots of large subdivisions of graphs
On a conjecture about uniquely colorable perfect graphs
On a multiplicative graph function conjecture
Dimensions of nonbinary antiprimitive BCH codes and some conjectures
Regularisation numerique d'orbites
On circuits in graphs
A note on rainbow matchings in strongly edge-colored graphs
m -Sparse solutions of linear ordinary differential equations with polynomial coefficients
On the balanced upper chromatic number of cyclic projective planes and projective spaces
Matchings and Hadwiger's Conjecture
On the connectivity of cages with girth five, six and eight
Robustness of some balanced block designs
Round-dance neighbour designs from terraces
Harmonic conjugation in harmonic matroids
Convexity cuts for multiple choice problems
Solution of a decision problem concerning unary Lindenmayer systems
Simplotopal maps and necklace splitting
On median graphs and median grid graphs
On the edge-integrity of some graphs and their complements
Note on alternating directed cycles
On the existence of a convex point subset containing one triangle in the plane
A randomised 3-colouring algorithm
New infinite families of 3-designs from preparata codes over Z 4
Enumeration of permutations by number of alternating descents
On the cardinalities of finite topologies
Incremental construction of 2-structures
Path spectra for trees
Kernels by properly colored paths in arc-colored digraphs
Inégalités entre fonctions symétriques élémentaires: applications à des problèmes de log-concavité
On vertex neighborhood in minimal imperfect graphs
Semi-regular graphs of minimum independence number
On a combinatorial problem in geometry
Connected Q -integral graphs with maximum edge-degree less than or equal to 8
No-hole (r+1)-distant colorings
The associative-commutative spectrum of a binary operation
Voltage graphs, weight systems and odd symmetry
Waiter-Client and Client-Waiter planarity, colorability and minor games
On 1-2-3 Conjecture-like problems in 2-edge-coloured graphs
Reduction procedures for calculating the determinant of the adjacency matrix of some graphs and the singularity of square planar grids
Dyck path enumeration
Edge-colorings avoiding rainbow and monochromatic subgraphs
Degree sequence and independence in K(4)-free graphs
Hom-properties are uniquely factorizable into irreducible factors
Some matroid inequalities
Minimal linear codes from defining sets over Fp+uFp
On maximal sublattices of finite lattices
Counting polycubes without the dimensionality curse
Chromatic polynomials of generalized trees
Some parameters of graph and its complement
A new feasibility condition for distance-regular graphs
On automorphism groups of a biplane (121, 16, 2)
Networklike metric spaces
Circumferences of 3-connected claw-free graphs, II
Some uniqueness results for upper bound
Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond
A simple upper bound for the hamiltonian index of a graph
A faster diameter problem algorithm for a chordal graph, with a connection to its center problem
A counterexample to a conjecture on edge-coloured tournaments
Weight of edges in normal plane maps
On weighted sums in abelian groups
Unavoidable subtrees
Hamiltonian properties of polyhedra with few 3-cuts - A survey
The coloring game on matroids
Large minimal realizers of a partial order II