yusuke1997/dblp-id-title huggingface dataset:
On ramsey numbers for large disjoint unions of graphs
On planar and dismantlable lattices
On Homotopy of connected graphs having the same degree function
Characterization of the induced matching extendable graphs with 2n vertices and 3n edges
On a uniformly random chord diagram and its intersection graph
The analysis of De Bruijn sequences of non-extremal weight
Permanental sums of graphs of extreme sizes
Note on the tight relative 2-designs on H(n, 2)
Kinematic mappings of plane affinities
Decomposition of Smith graphs in maximal reflexive cacti
The Chvátal-Erdös condition and pancyclic line-graphs
A counter-example to a conjecture relating complete sets of frequency squares and affine geometries
The strong chromatic index of a cubic graph is at most 10
Existence of incomplete resolvable minimum coverings of pairs by triples
On restricted edge-colorings of bicliques
Edge frames of graphs: A graph embedding problem
Asymptotic behaviour of the containment of certain mesh patterns
Strong weak domination and domination balance in a graph
The pagewidth of trivalent planar graphs
Domination game and minimal edge cuts
Star-factorization of symmetric complete bipartite digraphs
Graphs with maximal Hosoya index and minimal Merrifield-Simmons index
Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
The number of partitions with distinct even parts revisited
A characterization of finite unions of arithmetic sequences
On m-centers in P t -free graphs
Absolute retracts and varieties generated by chordal graphs
On Hamiltonian cycles in Cayley graphs of wreath products
A combinatorial interpretation of the p, q-hit numbers
New bounds for the minimum length of quaternary linear codes of dimension five
On the girth of extremal graphs without shortest cycles
On latin squares and the facial structure of related polytopes
Proof of a conjecture of Häggkvist on cycles and independent edges
On the total distance between nodes in tournaments
2-factors and hamiltonicity
Hamiltonian circuits in random graphs
Edge-primitive Cayley graphs on abelian groups and dihedral groups
A construction of cyclic Steiner triple systems of order p n
All trees are 1-embeddable and all except stars are 2-embeddable
Reorientations of covering graphs
Complete graphs without polychromatic circuits
Dominating subgraphs in graphs with some forbidden structures
The existence of referee squares
The weak order on the hyperoctahedral group and the monomial basis for the Hopf algebra of signed permutations
On a g g-fold joint m m-spotty Lee weight enumerator
Remarks on the distribution of colors in Gallai colorings
A hypergroupal characterization of projective planes
Equivalence classes of ballot paths modulo strings of length 2 and 3
Pancyclism in hamiltonian graphs
Ordered trees and the inorder traversal
On graphs with three eigenvalues
On a pair of orthogonal golf designs
On a problem of R. Halin concerning infinite graphs
Connectivity of submodular functions
A solitaire game played on 2-colored graphs
Blocker size via matching minors
Induction theorems for generalized Bhaskar Rao designs
Sur les parcours hamiltoniens dans les graphes orientes
Golden ratios in a pairs covering problem
Counting polyominoes: Yet another attack
A note on decompositions of transitive tournaments
Covering boxes by points
On graphs with equal domination and 2-domination numbers
Some new Z -cyclic whist tournament designs
Radicals and primes in incidence algebras
Hadwiger numbers and over-dominating colourings
Minimum fractional dominating functions and maximum fractional packing functions
Recursive constructions for the higher Stasheff - Tamari orders in dimension three using the Outer Tamari and Tamari Block posets
Improved 2-distance coloring of planar graphs with maximum degree 5
Sets of partially orthogonal latin squares and projective planes
q-Hypergeometric solutions of q-difference equations
Packing edge-disjoint cycles in graphs and the cyclomatic number
Linear mappings which preserve acyclicity properties of graphs and digraphs and applications to matrices
Path coverings of the vertices of a tree
Transitive factorizations of free partially commutative monoids and Lie algebras
Maximal sized antichains in partial orders
Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are (3,1)-colorable
Extremal problems for the Möbius function in the face lattice of the n-octahedron
Directed cycle factors with given arcs and lengths
On Cayley graphs of rectangular groups
Parallel realization of permutations over trees
Triangulated edge intersection graphs of paths in a tree
A new lower bound on the optimal pebbling number of the grid
Extending two theorems of A. Kotzig
Total domination stable graphs upon edge addition
Cycle covers of cubic multigraphs
Triangle decompositions of PG(n - 1,2)
Disjoint subgraphs of large maximum degree
A constructive solution to a problem of ranking tournaments
Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs
On the existence of a matching orthogonal to a 2-factorization
Extremal (r, λ)-designs
Triangulated neighborhoods in even-hole-free graphs
Induced cycles in crossing graphs of median graphs
Extremal 3-connected graphs
Trivially perfect graphs
New ternary linear codes from projectivity groups
On strong distances in oriented graphs
The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
The inertia of distance matrices of some graphs
On decomposition of r-partite graphs into edge-disjoint hamilton circuits
Edge isoperimetric inequalities for product graphs
On global domination critical graphs
Factors of the Gaussian coefficients
Feasible edge colorings of trees with cardinality constraints
The sizes of maximal planar, outerplanar, and bipartite planar subgraphs
On the structure of the lattice of noncrossing partitions
Game connectivity of graphs
Bounding the size of certain rank 3 geometries with designs as rank 2 residues
The 6-relaxed game chromatic number of outerplanar graphs
Inequalities for perfect systems of difference sets
Clique partitions of the cocktail party graph
A short solution of Heawood's empire problem in the plane
Hamiltonian powers in threshold and arborescent comparability graphs
Binary construction of quantum codes of minimum distances five and six
A (2 k + 1)-regular graph with page-number k
A combinatorial proof of Dyson's conjecture
Ring graphs and complete intersection toric ideals
On elements in small cocircuits in minimally k-connected graphs and matroids
Ramsey numbers in octahedron graphs
A note on 3-connected cubic planar graphs
On a different weighted zero-sum constant
Spanning trees in graphs of minimum degree 4 or 5
Bounds on the maximum number of Latin squares in a mutually quasi-orthogonal set
Another proof of the 5-choosability of K 5 -minor-free graphs
Vertex degree sums for perfect matchings in 3-uniform hypergraphs
Facial entire colouring of plane graphs
Near automorphisms of cycles
Constant tolerance intersection graphs of subtrees of a tree
Restricted permutations refined by number of crossings and nestings
Forbidden subgraphs and the existence of spanning k-trees
Graph parameters, implicit representations and factorial properties
On the hulls of cyclic codes of oddly even length over Z4
All triples for orthogonal designs of order 40
Cheeger constants of Platonic graphs
Hamiltonicity and restricted block-intersection graphs of t-designs
On ve-degrees and ev-degrees in graphs
New bounds for chromatic polynomials and chromatic roots
A two-commodity cut theorem
Two theorems on graceful trees
All block designs with b = ( k v )/2 exist
On the cycle-path bipartite Ramsey number
Graph whose edges are in small cycles
Some partitions of positive integers
Fundamentals of planar ordered sets
Two bijections for the area of Dyck paths
On Toeplitz codes of index t and isometry codes
K 7 -minors in optimal 1-planar graphs
Unified approach to the generalized Turán problem and supersaturation
Critical cyclic patterns related to the domination number of the torus
Longest run of equal parts in a random integer composition
Odd neighborhood transversals on grid graphs
Random induced subgraphs of Cayley graphs induced by transpositions
The reconstruction of separable graphs with 2-connected trunks that are series-parallel networks
An extension theorem for Steiner systems
Product partial orders with the sperner property
Adjacent vertices on the b-matching polyhedron
Odd or even on plane trees
Binomial coefficient codes over GF(2)
Partial Hamming graphs and expansion procedures
Symmetric circular matchings and RNA folding
All one-term tight descriptions of 3-paths in normal plane maps without K4-e
Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
On the arithmetic of cycles for the Collatz-Hasse ('Syracuse') conjectures
Pseudo-cartesian product and hamiltonian decompositions of Cayley graphs on abelian groups
Constrained graph layout by stress majorization and gradient projection
Acyclic improper colourings of graphs with bounded maximum degree
Expansions of the chromatic polynomial
5-Chromatic even triangulations on the Klein bottle
NP-completeness and degree restricted spanning trees
Edge-partitions of graphs and their neighbor-distinguishing index
Distributive lattices as a generalization of Brouwerian lattices
Codes identifying sets of vertices in random networks
On partitions of K2, 3-free graphs under degree constraints
On the oriented diameter of near planar triangulations
Bipartite density of cubic graphs: the case of equality
Palindromicity of the numerator of a statistical generating function
Tournaments associated with multigraphs and a theorem of Hakimi
The square chromatic number of the torus
A class of pbib-designs obtained from projective geometries
A survey of selected recent results on total domination in graphs
Codes and designs in Grassmannian spaces
Families of chains of a poset and Sperner properties
G-parking functions, acyclic orientations and spanning trees
On the roots of maximal matching polynomials
On the lower length of the closed-set lattice of a tree
The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices
Permutations avoiding certain patterns: The case of length 4 and some generalizations
Techniques in matroid reconstruction
Some families of chromatically unique bipartite graphs
Dol sequences
Fractional set systems with few disjoint pairs
Disjoint path covers in cubes of connected graphs
On the size and structure of t-representable sumsets
The maximum Wiener index of a uniform hypergraph
Construction and properties of ( r, s, t )-inverse quasigroups. I
On a question regarding visibility of lattice points--III
Mixed hypercacti
On some extremal connectivity results for graphs and matroids
Mixed unit interval graphs
Almost eulerian compatible spanning circuits in edge-colored graphs
On complementary graphs with no isolated vertices
beta-neighborhood closures for graphs
Permutation invariant lattices
The maximum spectral radius of { C 3 , C 5 }-free graphs of given size
A census of infinite distance-transitive graphs
On endomorphism-regularity of zero-divisor graphs
Boolean sums of sets of certain designs
On the fixed edge of planar graphs with minimum degree five
Generalized activities and K-terminal reliability. II
Ramsey-minimal saturation numbers for matchings
The error-correcting pair for TGRS codes
Disjoint covering systems of rational Beatty sequences
A note on runs of geometrically distributed random variables
Block designs signed over groups of order 2 n 3 m
Convolutions on WASS hyperstructures
A note on Winkler's algorithm for factoring a connected graph
The well-covered dimension of random graphs
How often do determinants over finite fields vanish?
Empty triangles in drawings of the complete graph
Constructions of uniform designs by using resolvable packings and coverings
Construction of some countable 1-arc-transitive bipartite graphs
About weak connectivity
Finite distributive lattices and doubly irreducible elements
The minimum size and maximum diameter of an edge-pancyclic graph of a given order
Almost regular c-partite tournaments contain a strong subtournament of order c when c >= 5
Rotation number of a unimodular cycle: An elementary approach
All Ramsey numbers for five vertices and seven or eight edges
A generalised upper bound for the k-tuple domination number
Florentine rows or left-right shifted permutation matrices with cross-correlation values >= 1
Geometry of classical groups over finite fields and its applications
Constructing 3-chromatic Steiner triple systems
Avoiding monotone arithmetic progressions in permutations of integers
Measures of edge-uncolorability
A combinatorial interpretation of the recurrence f n+1 = 6f n - f n-1
Note on some determinants of q-binomial numbers
The minimal non-(leq k)-reconstructible relations
Graphs with edge-preserving majority functions
On hamiltonian circuits in cartesian products of Cayley digraphs
An extension of regular supermagic graphs
On finite lattices generated by their doubly irreducible elements
Degree powers in graphs with a forbidden forest
Decompositions into two linear forests of bounded lengths
Coloring hypergraphs with bounded cardinalities of edge intersections
On uniquely 3-colorable planar graphs
Towards size reconstruction from fewer cards
Every planar graph without triangles adjacent to cycles of length 3 or 6 is (1, 1, 1)-colorable
Analytic methods in asymptotic enumeration
A generalization of Parikh's semilinear theorem
Tournament completions of bipartite tournaments and their augmented directed cycles
Recursion polynomial for cubic rotation symmetric Boolean functions
Tree width and regular triangulations
Covering the edge set of a directed graph with trees
On linear complementary pairs of algebraic geometry codes over finite fields
Two-factors in orientated graphs with forbidden transitions
A class of q-ary codes
Counting lattice points in pyramids
Acyclic L-coloring of graphs with maximum degrees 5 and 6
Implicational classes of De Morgan lattices
Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices
Bipartite almost distance-hereditary graphs
Linear sets in finite projective spaces
Infinite families of MDR cyclic codes over Z4 via constacyclic codes over Z4[u]∕〈u2-1〉
On short cycles through prescribed vertices of a graph
Further results on signed graphs with exactly two distinct main eigenvalues
Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected
Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets
Hexagonal systems with forcing edges
Matching transformation graphs of cubic bipartite plane graphs
Degree sum conditions for path-factors with specified end vertices in bipartite graphs
Intervals in matroid basis graphs
A combinatorial proof of a Chevyshev polynomial identity
The extended 1-perfect trades in small hypercubes
On weighted spectral radius of unraveled balls and normalized Laplacian eigenvalues
Lattices of closure operators
An efficient method to construct self-dual cyclic codes of length ps over Fpm+uFpm
Multicolor Ramsey numbers for triple systems
Classification of nonorientable regular embeddings of cartesian products of graphs
Automorphisms of the zero-divisor graph of the ring of all n×n matrices over a finite field
Egalitarian Steiner quadruple systems of doubly even order
Equiangular lines and the Lemmens-Seidel conjecture
On generalized Petersen graphs labeled with a condition at distance two
Transitivity on sets of independent points in geometric lattices
Deciding nonconstructibility of 3-balls with spanning edges and interior vertices
Limit distribution for the existence of Hamiltonian cycles in a random graph
The reduction of graph families closed under contraction
The Ramsey numbers for disjoint unions of cycles
An improved product construction for large sets of Kirkman triple systems
Cross-cloning and antipodal graphs
A topological lower bound for the chromatic number of a special family of graphs
Kernels of minimum size gossip schemes
Four-regular graphs with extremal rigidity properties
Median algebras
Long cycles in 4-connected planar graphs
On Hamiltonicity of {claw, net}-free graphs
A new result on disjoint cycles in graphs
Precoloring extension for 2-connected graphs with maximum degree three
On mixed Moore graphs
Complete graphs and complete bipartite graphs without rainbow path
On smallest 3-polytopes of given graph radius
On the tightness of the I independence ratio
Nonexistence of some Griesmer codes over F q
All two-color Rado numbers for a(x + y) = bz
Reed-Muller codes and permutation decoding
Coloring perfect degenerate graphs
A lower bound for the number of blocks of t-(v, k, λ) designs with t odd
Uniform distances in rational unit-distance graphs
Embeddings of P 3 -designs into bowtie and almost bowtie systems
Independent arborescences in directed graphs
Heredity properties of connectedness in edge-coloured complete graphs
Rainbow simplices in triangulations of manifolds
The number of kings in a multipartite tournament
A generalization of Ore's Theorem involving neighborhood unions
Upper embeddability and connectivity of graphs
Problem 47 : Posed by Aviezri S. Fraenkel
Note on 3-paths in plane graphs of girth 4
On tetravalent half-arc-transitive graphs of girth 5
Multicolor Turán numbers
Infinite families of crossing-critical graphs with given average degree
Wom-codes construits à partir des codes de hamming
Lyndon words, polylogarithms and the Riemann Zeta function
Four families of squares of BCH codes and their complements
Minimal graphs for contractible and dismantlable properties
Refinements of degree conditions for the existence of a spanning tree without small degree stems
Planar graphs having no proper 2-immersions in the plane. III
Remarks on umbral evaluations of chromatic polynomials
On large semi-linked graphs
Invariant systems of representatives, or the cost of symmetry
Large sets of resolvable Mendelsohn triple systems of prime power sizes
An extremal problem on bigraphic pairs with an A-connected realization
Pancyclicity in claw-free graphs
Determination of the residue classes of a polynomial at integral arguments
Complementary cycles in regular bipartite tournaments
Triangle colorings require at least seven colors
Cost colourings of hypergraphs
Refinements of Beck-type partition identities
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
Some notes on the (q, t)-Stirling numbers
Resolvable BIBDs with block size 7 and index 6
An explicit representation and enumeration for self-dual cyclic codes over F2m+uF2m of length 2s
Covering a cubic graph by 5 perfect matchings
Generalized signed graphs of large girth and large chromatic number
The congestion of n -cube layout on a rectangular grid
Improved pebbling bounds
Asymmetrising sets in trees
Domination stability in graphs
Minimal fill in O( n 2.69 ) time
Edge degrees and dominating cycles
Hamiltonian decompositions of complete k-uniform hypergraphs
On the size and structure of certain subsequence sum set
Three color Ramsey number of K 4 -e
How to determine a partition up to conjugation using multisets of hook lengths
Vertex-, edge-, and total-colorings of Sierpinski-like graphs
Euler cycles in the complete graph K 2m+1
Existence of r-fold perfect (v, K, 1)-Mendelsohn designs with K SUBSET OF OR EQUAL TO {4, 5, 6, 7}
On edge-primitive graphs of order twice a prime power
The correct solution to Berlekamp's switching game
Path-factorizations of complete bipartite multigraphs
Weight-dependent commutation relations and combinatorial identities
A Stern-type congruence for the Schröder numbers
New MDS EAQECCs derived from constacyclic codes over Fq2+vFq2
Minimal graphs of a torus, a projective plane and spheres and some properties of minimal graphs of homotopy classes
On the concatenated structures of a [49, 18, 12] binary abelian code
A lower bound on the independence number of a graph
The independence number of graphs in terms of degrees
An exact construction of digital convex polygons with minimal diameter
Asymptotic bounds for the number of convex n-ominoes
Distance domination versus iterated domination
Constructing the minimum dominating sets of generalized de Bruijn digraphs
On excluded minors for classes of graphical matroids
Prime power divisors of binomial coefficients
Partitions of factorisations of parameter words
Hamilton cycles in circulant digraphs with prescribed number of distinct jumps
On a Turán-type hypergraph problem of Brown, Erdos and T. Sós
Symbolic incidence geometry and finite linear spaces
A note on the 2-power of Hamilton cycles
Characterization of a class of graphs related to pairs of disjoint matchings
The tight span of an antipodal metric space - Part I: : Combinatorial properties
Two-geodesic-transitive graphs which are locally connected
Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
Enumeration of almost Moore digraphs of diameter two
Stabilized column generation
Paired domination in graphs with minimum degree four
On a new class of productive regular Hadamard matrices
An implicit degree condition for hamiltonian graphs
Shortcuts, diversions, and maximal chainsin partially ordered sets
Relating propelinear and binary G -linear codes
On the structure of optimal error-correcting codes
Flag-symmetry of the poset of shuffles and a local action of the symmetric group
Maximal frequencies of equivalences with small classes
A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
Generalized threshold decoding of cyclic codes
On the edge-chromatic number of a graph
Multi-color Ramsey numbers of two bipartite graphs
On the structure of strong 3-quasi-transitive digraphs
The nonexistence of some quaternary linear codes of dimension 5
On graphs whose maximal subgraphs have at most two orbits
Critical graphs for the chromatic edge-stability number
A simple lower bound on edge coverings by cliques
Inversions in ranking data
Stanley's conjectures on the Stern poset
Direct construction of code loops
Decomposition of complete graphs into paths and stars
Some orientation theorems for restricted DP-colorings of graphs
Almost self-complementary circulant graphs
The 3-choosability of plane graphs of girth 4
2¯-separable codes with length 5
Genus, thickness and crossing number of graphs encoding the generating properties of finite groups
Uniformly resolvable decompositions of K v into K 2 and K 1, 3 graphs
Homomorphisms from sparse graphs to the Petersen graph
Variations on a theme of Kuratowski
On circular critical graphs
Derangements on the n-cube
On degree sum conditions for 2-factors with a prescribed number of cycles
Graphs with the Erdös-Ko-Rado property
Combinatorial problems on the existence of large submatrices II
Enumeration of pairs of permutations
A note on chromatic number of (cap, even hole)-free graphs
Distance-regular graphs with classical parameters that support a uniform structure: Case q ≥ 2
The least point covering and domination numbers of a graph
A Helly theorem in weakly modular space
Sliding puzzles and rotating puzzles on graphs
On a class of polynomials obtained from the circuits in a graph and its application to characteristics polynomials of graphs
Graphs with only caterpillars as spanning trees
Dual equivalence with applications, including a conjecture of Proctor
A group action on noncrossing partitions
Constructing cospectral graphs via regular rational orthogonal matrices with level two
Lattice paths enumerations weighted by ascent lengths
A type of factorization of finite Abelian groups
Identities from representation theory
On the Ramsey number r(H+K _ n , K n )
Clique partitions of complements of forests and bounded degree graphs
An improved finiteness theorem for graphical t -designs
The existence of near-Skolem and hooked near-Skolem sequences
The decomposition of graphs into k-connected components
The maximum size of a nonhamiltonian graph with given order and connectivity
Une généralisation automorphe des nombres de Stirling
Balanced graphs with minimum degree constraints