yusuke1997/dblp-id-title huggingface dataset:
A little statistical mechanics for the graph theorist
On the construction of three-valued Lukasiewicz-Moisil algebras
On super edge-antimagic total labelings of mK n
A classification of the structures of some Sperner families and superimposed codes
On 11-improper 22-coloring of sparse graphs
Dominating sets in perfect graphs
Antitwins in partitionable graphs
A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs
On pancyclism in hamiltonian graphs
Counting polynomials with distinct zeros in Galois ring GR(p2,r)
Reconnaissance des graphes de cordes
Hypergraphic submodular function minimization
Divisibility among power matrices associated with classes of arithmetic functions
Unsolved problems on magic squares
Transitive (q - 1)-fold packings of PG (q)
Which graphs allow infinite nonrepetitive walks?
Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs
Two characterizations of the grid graphs
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
On the number of prime implicants
Oracle-polynomial-time approximation of largest simplices in convex bodies
Cycles and new bounds for the chromatic number
Not all partial cubes are Θ-graceful
On L (2, 1)-labelings of Cartesian products of paths and cycles
Krein parameters and antipodal tight graphs with diameter 3 and 4
Separation par une droite dans les matroïdes orientes de rang 3
Rebuilding convex sets in graphs
Lloyd's theorem for perfect codes
Sur quelques propriétés de symétrie des nombres de Genocchi
A new upper bound on the queuenumber of hypercubes
A reflexive digraph that is retraction trivial but not endomorphism trivial
Weighted independent sets in a subclass of P 6 -free graphs
Partial Latin rectangle graphs and autoparatopism groups of partial Latin rectangles with trivial autotopism groups
A conjecture on the algebraic connectivity of connected graphs with fixed girth
On the vertices of a 3-partite tournament not in triangles
Stable planes
On the FKB conjecture for disjoint intersections
On the existence and application of incomplete nearly Kirkman triple systems with a hole of size 6 or 12
A new cubical h-vector
Spanning graphs of hypercubes: starlike and double starlike trees
Connectedness of the graph of vertex-colourings
New MDS codes of non-GRS type and NMDS codes
Note: TP 2 =Bruhat
The Erdos-Ko-Rado properties of various graphs containing singletons
On maximal objects in classes of (DI)graphs determined by prescribed factorobjects
Triangle-free graphs with large chromatic numbers
Modulo orientations and matchings in graphs
Short proofs for cut-and-paste sorting of permutations
Critically paintable, choosable or colorable graphs
Sur la cardinalite maximum des couplages d'hypergraphes aleatoires uniformes
Proper edge-colorings with a rich neighbor requirement
Ramsey numbers of uniform loose paths and cycles
Vertex covers by monochromatic pieces - A survey of results and problems
Homothetic interval orders
Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture
Shortness coefficients of simple 3-polytopal graphs with edges of only two types
Packings in bipartite prisms and hypercubes
Describing 3-faces in normal plane maps with minimum degree 4
A contribution to the theory of voltage graphs
Kempe equivalent list edge-colorings of planar graphs
Two classes of q-ary codes based on group divisible association schemes
On the construction of graphs of nullity one
Minimal indecomposable graphs
A quantitative Erdős-Fuchs type result for multivariate linear forms
The deficiency of a regular graph
Chordal circulant graphs and induced matching number
A 'large deviation' phenomenon in discrete geometry, I
M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivities
Complementary cycles in regular multipartite tournaments, where one cycle has length five
Symmetric graphs of prime valency associated with some almost simple groups
On partitions of discrete boxes
Latin hypercubes and MDS codes
Order types of reflection orders on affine Weyl groups
Five mutually orthogonal Latin squares of orders 24 and 40
Rabin numbers of Butterfly networks
A polynomial-time algorithm for finding zero-sums
A combinatorial problem for vector spaces over finite fields
Low edges in 3-polytopes
The irregularity strength of K m, m is 4 for odd m
Pairs of forbidden induced subgraphs for homogeneously traceable graphs
Number of minimum vertex cuts in transitive graphs
Some derived steiner triple systems
Bi-cyclic decompositions of complete graphs into spanning trees
Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges
Bipartite cubic graphs and a shortness exponent
Properties of Steiner triple systems of order 21
On cubic vertex-transitive non-Cayley graphs of 2-power orders
A note on DOL length sets
New results in vertex sedentariness
A note on chordal bound graphs and posets
Unitary designs with regular sets of points
Path eccentricity of k-AT-free graphs and application on graphs with the consecutive ones property
Complements and consistent closures
All trees contain a large induced subgraph having all degrees 1 (mod k)
Subsets of a finite set that almost always intersect each other in lambda elements
Distribution of similar configurations in subsets of Fqd
Self-dual and maximal self-orthogonal codes over F 7
On realization graphs of degree sequences
The skew chromatic index of a graph
Classes of self-orthogonal or self-dual codes from orbit matrices of Menon designs
Nordhaus-Gaddum results for genus
Two-fold triple systems without repeated blocks
A generalized Ihara zeta function formula for simple graphs with bounded degree
On the domination of hypergraphs by their edges
Graphs and digraphs with given girth and connectivity
Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor
Two results on matching extensions with prescribed and proscribed edge sets
Variation on a theme of Solomon
On the existence of regular antichains
Gallai's path decomposition conjecture for triangle-free planar graphs
A class of two or three weights linear codes and their complete weight enumerators
On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels
A cycle lemma for permutation inversions
Shortness parameters of families of regular planar graphs with two or three types of face
A Dirac-type characterization of k -chordal graphs
On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7
Strong complete mappings for 3-groups
Construction of two symmetric block designs for (71, 21, 6)
The Max-Welter game
Combinatorics of q,r-analogues of Stirling numbers of type B
Bibliography on domination in graphs and some basic definitions of domination parameters
On additive partitions of integers
List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
A conjecture on k-transitive digraphs
A short proof of Meyniel's theorem
Vertex critical 4-dichromatic circulant tournaments
Une extension du problème du point fixe pour des graphes simples
The existence of C k -factorizations of K 2n -F
On the symmetry of Welch- and Golomb-constructed Costas arrays
Complete weight enumerators and weight hierarchies of two classes of linear codes
A degree sum condition for the existence of an S-path-system in a bipartite graph
On the maximum second eigenvalue of outerplanar graphs
Block-avoiding point sequencings of directed triple systems
An inversion relation of multinomial type
The asymptotic number of claw-free cubic graphs
The mechanics of shuffle products and their siblings
Globally simple Heffter arrays H(n;k) when k≡0, 3(mod4)
Sylvester's bijection between strict and odd partitions
Duality between quasi-concave functions and monotone linkage functions
Trees with depression three
On the lattice of order ideals of an up-down poset
An upper bound on the number of (132, 213)-avoiding cyclic permutations
Vertex distinguishing colorings of graphs with Delta(G)=2
On a conjecture of Stanley on Jack symmetric functions
Cycles through k+2 vertices in k-connected graphs
Antipodal Gray codes
On the vertex-arboricity of K 5 -minor-free graphs of diameter 2
The spectrum of optimal strong partially balanced designs with block size five
On the mean chromatic number
Fool's solitaire on joins and Cartesian products of graphs
Bounds on codes over an alphabet of five elements
Proper 1-immersions of graphs triangulating the plane
Ramsey numbers for transitive tournaments
Maximal Sidon sets and matroids
Sur une loi de probabilite conditionelle de kleitman
On k-anti-traceability of oriented graphs
Rainbow Hamilton cycles and lopsidependency
Higher order Laguerre inequalities for the partition function
Element deletion changes in dynamic coloring of graphs
Super-simple group divisible designs with block size 4 and index λ = 7, 8
Point partition numbers: Decomposable and indecomposable critical graphs
On the Erdős-Sós conjecture for graphs having no path with k+4 vertices
Total positivity of Catalan triangle
A basic elementary extension of the Duchet-Meyniel theorem
Shrinking integer lattices
On congruences and continued fractions for some classical combinatorial quantities
Some remarks on long monochromatic cycles in edge-colored complete graphs
Chromatic capacities of graphs and hypergraphs
On the number of zero sum subsequences
Cordes, arbres et permutations
Codes for perfectly correcting errors of limited size
Ramsey numbers in complete balanced multipartite graphs. Part I: Set numbers
On constructing snakes in powers of complete graphs
A characterization of 2-connected {K1, 3, N3, 1, 1}-free non-Hamiltonian graphs
The invertible elements of the monoid of dead-ending misère games
The alternating polynomials and their relation with the spectra and conditional diameters of graphs
On the distribution of distances in finite sets in the plane
On triple-sum-sets and two or three weights codes
On designs in compact metric spaces and a universal bound on their size
Graphs with many large degrees
On the computation of the hull number of a graph
A combinatorial proof of the Cayley-Hamilton theorem
Isometric path complexity of graphs
Superfluous paths in strong digraphs
On the structure of perfectly divisible graphs
Domination alteration sets in graphs
Evacuation of labelled graphs
Gaps in samples of geometric random variables
Combinatorics on words and generating Dirichlet series of automatic sequences
On multiset k-families
Searching for an edge in a graph with restricted test sets
Edge decomposition of complete tripartite graphs
The relation graph
A small complete arc in PG(2, q), q=p 2 , p=3 (mod 4)
Generating orthomorphisms of GF(q) +
On a limit of the method of Tashkinov trees for edge-colouring
Degree sequences of random graphs
Size-Ramsey numbers of cycles versus a path
Posets in which every cutset meets every fibre
Degree sum and connectivity conditions for dominating cycles
A short proof that the list packing number of any graph is well defined
On list critical graphs
On the existence of (k, l)-kernels in digraphs
On the signed edge domination number of graphs
r-Strong edge colorings of graphs
Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs
Decomposing a planar graph with girth at least 8 into a forest and a matching
Forbidden pairs of disconnected graphs for traceability in connected graphs
Complete m-spotty weight enumerators of binary codes, Jacobi forms, and partial Epstein zeta functions
On a combinatorial problem of P. Erdös and L. Lovász
A constructive decomposition and Fulkerson's characterization of permutation matrices
Mrs. Correct and majority colorings
Extremal problems on permutations under cyclic equivalence
Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
Strong properties in partially ordered sets I
A study on oriented relative clique number
Lonesum decomposable matrices
The chromatic numbers of graph bundles over cycles
Still another triangle-free infinite-chromatic graph
New mixed Moore graphs and directed strongly regular graphs
On the probability that subset sequences are minimal
Characterizing defect n-extendable graphs and (2n+1)-critical graphs
A generalization of Vizing's theorem on domination
Planar graphs without 5-cycles or without 6-cycles
The logarithmic distribution of leading digits and finitely additive measures
Efficient crossover designs for comparing test treatments with a control treatment
On critical subgraphs of colour-critical graphs
Mixed hypergraphs and other coloring problems
The color cost of a caterpillar
On finite superuniversal graphs
Ternary paving matroids
A conjecture of Neumann-Lara on infinite families of r-dichromatic circulant tournaments
On transitive irreducible BLT-sets
A note on colorings of finite planes
Bordeaux 3-color conjecture and 3-choosability
Improvements on Hippchen's conjecture
A new method of generating Hamiltonian cycles on the n-cube
Two classes of chromatically unique graphs
Bipacking pairs by quintuples: The case nu=13 (mod 20)
Some results on characterizing the edges of connected graphs with a given domination number
On essential components and critical sets of a graph
Ballot permutations and odd order permutations
Maximal sets of Hamilton cycles in D n
The uniformity space of hypergraphs and its applications
An extension of the direction problem
Recurrences for characters of the symmetric group
On the half?half case of the Zarankiewicz problem
Quantum walks on join graphs
Enumerating alternating-runs with sign in Type A and Type B Coxeter groups
Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
Limit distribution for the existence of hamiltonian cycles in a random graph
On orthogonal subcategories of locally presentable categories
A note on trees of maximum weight and restricted degrees
Color-reversal by local complementation
The number of maximal independent sets in a connected graph
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
Minus domination number in k-partite graphs
Reduced words in affine Coxeter groups
Connected k-dominating graphs
Clutters with tau 2 =2tau
The existence of regular self-complementary 3-uniform hypergraphs
On the existence of k-partite or K p -free total domination edge-critical graphs
Equidistant codes with distance 12
Covering radii are not matroid invariants
New results on chromatic index critical graphs
The complexity of power graph associated with finite p-groups
On the transversal number and VC-dimension of families of positive homothets of a convex body
Embedding partial G-designs where G is a 4-cycle with a pendant edge
Combinatorial bounds on nonnegative rank and extended formulations
Vertex-magic total labeling of odd complete graphs
New upper bounds on the number of non-zero weights of constacyclic codes
On minimal neighbourhood-connected graphs
Hamilton cycles in tensor product of graphs
Almost avoiding permutations
A proof by graphs that PSL(2, 7) ~= PSL(3, 2)
Flow polytopes and the graph of reflexive polytopes
The majority action on infinite graphs: strings and puppets
Cubic graphs with equal independence number and matching number
Codes from the incidence matrices of graphs on 3-sets
A note on the complexity of finding regular subgraphs
More mutually orthogonal latin squares
On the Seidel integral graphs which belong to the class αG ∪ βG where G and G are two regular integral graphs
Hoàng-Reed conjecture holds for tournaments
Efficient reconstruction of partitions
On the reduced Euler characteristic of independence complexes of circulant graphs
The uniqueness of the 1-system of Q -(7, q ), q even
An upper bound on the P 3 -Radon number
Generating convex polyominoes at random
A class of graphs for which the ulam conjecture holds
Some conditions for 1-transitivity
Traceability in graphs with forbidden triples of subgraphs
Préordres, résiduation et espaces de fermeture
An algebraic identity on q-Apéry numbers
A parameter linked with G-factors and the binding number
The Ramsey numbers of large cycles versus wheels
A characterization of graphs with given maximum degree and smallest possible matching number
Path-sequential labellings of cycles
The quaternary complex Hadamard matrices of orders 10, 12, and 14
On arc-transitive Cayley digraphs of out-valency 3
On t-intersecting families of signed sets and permutations
Free and almost-free subsemigroups of a free semigroup
Preface to the Special Issue of Discrete Mathematics : Dedicated to the Algebraic and Extremal Graph Theory Conference, August 7-10, 2017, University of Delaware, Newark, USA
Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph
A short proof of the Collapsing Walls Lemma
An umbral relation between pattern and commutation in strings
Hypergraphes de Petersen! Hypergraphes de Moore?
On a glass of abstract polytopes constructed from binary codes
A neighborhood union condition for the existence of a spanning tree without degree 2 vertices
Small surface trades in triangular embeddings
The size of k-pseudotrees
Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles
Graphs cospectral with NU( n + 1, q 2 ), n ≠ 3
Metallic cubes
Deleting edges from Ramsey graphs
Extending matchings in graphs: A survey
Iterative processes related to Riordan arrays: The reciprocation and the inversion of power series
Determinantal inequalities for positive definite matrices
Groups with sign structure and their antiautomorphisms
The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than -4
On a construction of schützenberger
Determinants and ranks of random matrices over Z m
A class of functions and their application in constructing semi-biplanes and association schemes
Even and odd diagonals in doubly stochastic matrices
Nonorientable biembeddings of cyclic Steiner triple systems generated by Skolem sequences
On a logical problem
Independent finite sums in graphs defined on the natural numbers
Sharp bounds for the generalized connectivity kappa 3 (G)
A note on highly connected K2,-minor free graphs
Edge decompositions into two kinds of graphs
Non-separating subgraphs
On a matroid identity
Totally odd immersions in line graphs
On the notion of cycles in hypergraphs
Diagonal flips in outer-torus triangulations
Connecting two types of representations of a permutation of Fq
Augmenting approach for some Maximum Set problems
A dedication to Professor Gary Chartrand
Path parity and perfection
Proper blocking sets in projective spaces
An application of matching theory of edge-colourings
Two Doyen-Wilson theorems for maximum packings with triples
Smooth designs
Characterization of Laborde-Mulder graphs (extended odd graphs)
A note on the strong chromatic index of bipartite graphs
The maximum number of cycles in the complement of a tree
Connected sequential colorings
Triangles in 3-connected matroids
Brualdi-Hoffman-Turán problem of the gem
On the existence of a combinatorial Schlegel diagram of a simplical unstacked 3-polytope with a prescribed set of vertices
A D-optimal design of order 150
Graph covers using t-colourable vertex sets
Segments in a planar nearring
Idempotents for derangement numbers
Shedding vertices of vertex decomposable well-covered graphs
Long monochromatic paths and cycles in 2-colored bipartite graphs
Sets with few distinct distances do not have heavy lines
A conjecture on bipartite graphical regular representations
Extending cycles in graphs
The existence of three idempotent IMOLS
The Hodge structure of the coloring complex of a hypergraph
An interpolation theorem for irredundant bases of closure structures
Gray codes for column-convex polyominoes and a new class of distributive lattices
Amas dans les graphes planaires
Duality between bent functions and affine functions
Clones satisfying the term condition
Local indecomposability of certain geometric graphs
The two-way rewriting in action: Removing the mystery of Euler-Glaisher's map
Enumeration of projective-planar embeddings of graphs
The harmonious coloring number of a graph
Antipaths in oriented graphs
On the minimal eccentric connectivity indices of graphs
The medial graph and voltage- current duality
Symmetric peaks and symmetric valleys in Dyck paths
A novel cryptanalytic attack on a family of RSA-like cryptosystems
On the hat guessing number of graphs
Irreducible polynomials over GF(2) with prescribed coefficients
On a q-analogue of Faà di Bruno's determinant formula
Hamiltonian properties of triangular grid graphs
Optimal ternary constant-composition codes with weight four and distance three
A topological framework for signed permutations
Collineations and dualities of partial geometries
The pebbling number of squares of even cycles
Random packing by matroid bases and triangles
Three measures of edge-uncolorability
Equivalences among Z2s-linear Hadamard codes
A larger class of reconstructible tournaments
On certain morphisms of sequential dynamical systems
Characterization and construction of Cayley graphs admitting regular Cayley maps
A new formula for the decycling number of regular graphs
Genus distributions of star-ladders
Loop homology of bi-secondary structures
The dual codes of negacyclic BCH codes of length qm+12
Block graphs with unique minimum dominating sets
Complete bipartite factorisations of K n, n
On finite weakly { s, t }-semiaffine linear spaces
Bipartite algebraic graphs without quadrilaterals
Hamiltonian cycles in vertex symmetric graphs of order 2P 2
Maximal sets of permutations constructed from projective planes
On weak cop numbers of transitive graphs
Partitions of the lines in PG(2n-1, s) into multifold spreads for s=3, 4
A combinatorial technique for simplicial complexes and some applications to finite groups
A note on atomistic weak congruence lattices
The spherical genus and virtually planar graphs
A note on edge-decompositions of planar graphs
Revisiting regular sequences in light of rational base numeration systems
Spanning eulerian subgraphs and matchings
Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs
Generating functions for generating trees
Cubical flips in quadrangulations of closed surfaces
A new construction of lattices from codes over GF(3)
Local and global majorities revisited
Efficiency and effectiveness of normal schedules on three dedicated processors
Leprechauns on the chessboard
A matching problem with side conditions
Two remarks on Ramsey's theorem
A Berge-keeping operation for graphs
Structural conditions for cycle completable graphs
Equations in the theory of Q-distributive lattices
Using bi-coset graphs to construct small regular and biregular graphs
On a graph colouring problem
Minimum balanced bipartitions of planar triangulations
Covering the edges of r-graphs with perfect matchings
On the geometry of a ( q + 1)-arc of PG(3, q ), q even
Bandwidth of theta graphs with short paths
On trees with the same restricted U-polynomial and the Prouhet-Tarry-Escott problem
Tutte polynomials of q -cones
On the asymptotic growth of bipartite graceful permutations
An upper bound for the number of independent sets in regular graphs
The hardness of intervalizing four colored caterpillars
Transversals in a collection of stars or generic trees
Integer eigenvalues of the n-Queens graph
A short proof of a conjecture on quasi-symmetric 3-designs
Resolvable 4-cycle group divisible designs with two associate classes: Part size even
Packing the maximum number of m × n tiles in a large p × q rectangle
A characterization of some graphs which do not contain 3-claws
Permutations, parenthesis words, and Schröder numbers
On sizes of complete arcs in PG(2, q)
A convex characterization of the graphs of the dodecahedron and icosahedron
On self-clique graphs with triangular cliques
On polynomial digraphs
An aperiodic set of 13 Wang tiles
Minimizing the number of independent sets in triangle-free regular graphs
Clique graphs of packed graphs
Extremal graphs for the odd prism
Amalgamating infinite latin squares
The enumeration of Hamiltonian polygons in rooted planar triangulations
The Erdős-Sós conjecture for spiders of large size