yusuke1997/dblp-id-title huggingface dataset:
On the perfect orderability of unions of two graphs
Maximum diameter of 3- and 4-colorable graphs
Online Ramsey theory for a triangle on -free graphs
Precoloring extension for K 4 -minor-free graphs
Circular chromatic number of subgraphs
Sufficient conditions for the existence of a path-factor which are related to odd components
On ramsey-tuŕan numbers for 3-graphs
Maximal sets of Hamilton cycles in K n, n
Reconstruction of locally finite connected graphs with at least three infinite wings
A Dichotomy Theorem for Γ-Switchable H-Colouring on m-Edge-Coloured Graphs
On planar intersection graphs with forbidden subgraphs
On relative length of longest paths and cycles
Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property
The number and average size of connected sets in graphs with degree constraints
Strongly Hamiltonian-connected locally semicomplete digraphs
Knot graphs
A simple proof of Moser's theorem
On a conjecture by Plummer and Toft
Some genuine graph models in anthropology
Hamiltonian chains in hypergraphs
Minimizing the Determinant of the Graph Laplacian
Cayley Graphs of Diameter 2 from Difference Sets
Diameter of the conjunction of two finite graphs
On the Kőnig?Egerváry theorem for k?paths
Multigraphs without large bonds are wqo by contraction
A Sharper Ramsey Theorem for Constrained Drawings
On Recognizing Frame and Lifted-Graphic Matroids
Improper Choosability and Property B
Average distance and maximum induced forest
Graph colorings with restricted bicolored subgraphs: II. The graph coloring game
Short cycle covers of graphs and nowhere-zero flows
Generating cycles in graphs with at most one end
The edge reconstruction of hamiltonian graphs
The fractional chromatic number of infinite graphs
Rank and biclique partitions of the complement of paths
Infinite paths in planar graphs I: Graphs with radial nets
Maximum matchings in a regular graph of specified connectivity and bounded order
Zero-sum delta-systems and multiple copies of graphs
Arc-disjoint out-branchings and in-branchings in semicomplete digraphs
A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
A note concerning graphs with unique f-factors
Seymour's Second Neighborhood Conjecture for Tournaments Missing a Generalized Star
A sharp lower bound for the circumference of 1-tough graphs with large degree sums
Graph limits: An alternative approach to s-graphons
Degree bounds for the circumference of 3-connected graphs
On graphs containing a given graph as center
On Rooted Packings, Decompositions, and Factors of Graphs
On k -detour subgraphs of hypercubes
Improved bounds for the chromatic number of a graph
Characterization of a class of triangle-free graphs with a certain adjacency property
The average degree of edge chromatic critical graphs with maximum degree seven
The Structure of Claw-Free Perfect Graphs
On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
Maximum odd induced subgraph of a graph concerning its chromatic number
Perfect matchings in highly cyclically connected regular graphs
Local Recognition of the Point Graphs of Some Lie Incidence Geometries
Domination-balanced graphs
Four-cycles in graphs without a given even cycle
Embedding arbitrary finite simple graphs into small strongly regular graphs
On zero-sum delta-systems and multiple copies of hypergraphs
Uniformly connected graphs
Toughness and hamiltonicity in almost claw-free graphs
Extremal graphs for homomorphisms
Subdivisions of large complete bipartite graphs and long induced paths in k -connected graphs
Distance matching extension and local structure of graphs
The characterization of zero-sum (mod 2) bipartite Ramsey numbers
The bichromaticity of cylinder graphs and torus graphs
A sufficient condition for a bipartite graph to have a k -factor
Graphs with the balas - uhry property
Powers of Hamiltonian paths in interval graphs
On embeddings of graphs containing no K 5 -minor
Choosability with Separation of Complete Multipartite Graphs and Hypergraphs
Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree
The graph constructions of H ajós and Ore
Sharp Dirac's theorem for DP-critical graphs
The rise and fall of the critical graph conjecture
On structural descriptions of lower ideals of trees
Directed Graphs Without Rainbow Triangles
On (2, k)?connected graphs
Maximal σ-polynomials of connected 3-chromatic graphs
Forbidden Subgraphs of the Odd-Distance Graph
Note on Choudum's "chromatic bounds for a class of graphs"
Compact topological minors in graphs
End-faithful spanning trees in graphs without normal spanning trees
Universal graphs with a forbidden near-path or 2-bouquet
The round-up property of the fractional chromatic number for proper circular arc graphs
An upper bound for the Folkman number F (3, 3; 5)
An upper bound for the path number of a graph
Strongly balanced graphs and random graphs
Independent perfect domination sets in Cayley graphs
Grünbaum colorings of toroidal triangulations
Partition graphs for finite symmetric groups
The cycle space of an embedded graph
Interval Non-edge-Colorable Bipartite Graphs and Multigraphs
Every ( p , p -2) graph is contained in its complement
On a conjecture of bollobás and bosák
Total Vertex Irregularity Strength of Dense Graphs
On dihedral flows in embedded graphs
Some results on the reconstruction problems. p -claw-free, chordal, and p 4 -reducible graphs
Filling the complexity gaps for colouring planar and bounded degree graphs
Cliques in squares of graphs with maximum average degree less than 4
On the uniqueness of the smallest graph of girth 5 and valency 6
Oriented list colorings of graphs
Cycles with a chord are graceful
Signed degree sequences and multigraphs
Good acyclic orientations of 4-regular 4-connected graphs
Some 3-connected 4-edge-critical non-Hamiltonian graphs
Enumeration of nonisomorphic planar maps
Characterizing 3-connected planar graphs and graphic matroids
On iterated clique graphs with increasing diameters
Full subgraphs
The crossing number of K 11 is 100
Tutte's spring theorem
On matroid separations of graphs
Multicolored trees in complete graphs
On the number of hamiltonian cycles in a maximal planar graph
Hermitian Adjacency Matrix of Digraphs and Mixed Graphs
Face 2-Colorable Embeddings with Faces of Specified Lengths
Chords of longest circuits of graphs embedded in torus and Klein bottle
[ a , b ]-factorization of a graph
Subdivisions with congruence constraints in digraphs of large chromatic number
Maximum pebbling number of graphs of diameter three
Geodetic rays and fibers in periodic graphs
Extensions of Fractional Precolorings Show Discontinuous Behavior
On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs
An extremal problem on K r -free graphs
Note on the cochromatic number of several surfaces
Circular coloring of signed graphs
Iterated clique graphs with increasing diameters
Decomposing graphs under degree constraints
How many graphs are unions of k -cliques?
Note on graphs without repeated cycle lengths
Hamilton Cycles, Minimum Degree, and Bipartite Holes
Erratum: On the edge-coloring problem for a class of 4-regular maps
A note on the bichromatic numbers of graphs
A generalization of simplicial elimination orderings
On 3-regular graphs having crossing number at least 2
Star partitions of graphs
Edge disjoint Hamilton cycles in graphs
On certain Hamiltonian cycles in planar graphs
Voltage graph embeddings and the associated block designs
Subdivisions of maximal 3-degenerate graphs of order d + 1 $d+1$ in graphs of minimum degree d $d$
On minimal imperfect graphs with circular symmetry
Exhaustive generation of k -critical H-free graphs
On the number of edges in maximally linkless graphs
Nonseparating Cycles Avoiding Specific Vertices
Generating quadrangulations of surfaces with minimum degree at least 3
Two-connected orientations of Eulerian graphs
Lower bounds for lower Ramsey numbers
Hereditary graph classes: When the complexities of coloring and clique cover coincide
On the size of graphs with complete-factors
Finite subgraphs of uncountably chromatic graphs
Domination in a graph with a 2-factor
Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$
Isomorphic factorizations of complete equipartite graphs
Families of graphs complete for the strong perfect graph Conjecture
Gallai-like characterization of strong cocomparability graphs
An upper bound for some ramsey numbers
Berge's Conjecture for Cubic Graphs With Small Colouring Defect
A New Class of Graphs That Satisfies the Chen-Chvátal Conjecture
Bounded diameter arboricity
Essential independent sets and Hamiltonian cycles
Cycle covers of graphs with a nowhere-zero 4-flow
Codiameters of 3-connected 3-domination critical graphs
The average size of a connected vertex set of a graph - Explicit formulas and open problems
Maximal and maximum independent sets in graphs with at most r cycles
Toroidal graphs containing neither K5- nor 6-cycles are 4-choosable
On the structure of extremal graphs of high girth
A note on graphs with diameter-preserving spanning trees
Planar Hypohamiltonian Graphs on 40 Vertices
Even dicycles
Polyhedra without cubic vertices are prism-hamiltonian
Forbidding Kuratowski Graphs as Immersions
The edge chromatic number of a directed/mixed multigraph
Turán and Ramsey numbers for 3-uniform minimal paths of length 4
On the orientation of meyniel graphs
Game chromatic number of outerplanar graphs
The 2-dimensional rigidity of certain families of graphs
Directed Steiner tree packing and directed tree connectivity
Circular colorings of edge-weighted graphs
Regular pseudo-median graphs
Ubiquity of oriented rays
Continuous k -to-1 functions between complete graphs whose orders are of a different parity
The connectivities of line and total graphs
Almost resolvable P k -decompositions of complete graphs
Inclusion chromatic index of random graphs
Connected search for a lazy robber
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs
Packing trees into planar graphs
On an upper bound for the harmonious chromatic number of a graph
Ore and Chvátal-type degree conditions for bootstrap percolation from small sets
A circular-arc characterization of certain rectilinear drawings
Disjoint cycles in star-free graphs
A variant of the Erdős-Rényi random graph process
Maximal sets of hamilton cycles in complete multipartite graphs
Gallai-Ramsey number for K 5 ${K}_{5}$
On the Multichromatic Number of s-Stable Kneser Graphs
An extremal problem for H -linked graphs
3-Color bipartite Ramsey number of cycles and paths
Extremal graphs having no matching cuts
Tree-width and circumference of graphs
Paul Erdös is seventy
Game chromatic index of k -degenerate graphs
Nowhere-zero 3-flows in products of graphs
Covering cliques with spanning bicliques
Packing Density of Sets With Only Two Nonmixed Gaps
Long paths through four vertices in a 2-connected graph
On directed local chromatic number, shift graphs, and Borsuk-like graphs
Maximum Bandwidth Under Edge Addition
Classes of intersection digraphs with good algorithmic properties
Graph Decomposition and Parity
Hamiltonian tournaments with the least number of 3-cycles
Graphs with unique Ramsey colorings
On a conjecture of Thomassen and Toft
Homomorphisms of graphs into odd cycles
On sequential labelings of graphs
Structure theorem for tournaments omitting N 5
Some probabilistic and extremal results on subdivisions and odd subdivisions of graphs
An isomorphic factorization of the complete graph
Erratum: The 2-surviving rate of planar graphs with average degree lower than 9 2
Attainable bounds for algebraic connectivity and maximally connected regular graphs
Komlós's tiling theorem via graphon covers
Asymptotically good edge correspondence colourings
On Three Conjectures of Thomassen and the Extremal Digraphs for Two Conjectures of Nash-Williams
The virtual k -factorability of graphs
König's edge coloring theorem without augmenting paths
Lower bounds for the average genus
The structure of graphs with a vital linkage of order 2
Domination in colored complete graphs
Ring graphs and Goldberg's bound on chromatic index
The complexity of the perfect matching-cut problem
Crossing numbers of graph embedding pairs on closed surfaces
Matchings in 1-planar graphs with large minimum degree
Maker Breaker on digraphs
Breaking small automorphisms by list colourings
The longest cycle of a graph with a large minimal degree
Cores of Imprimitive Symmetric Graphs of Order a Product of Two Distinct Primes
On λ $\lambda $-backbone coloring of cliques with tree backbones in linear time
Mader's conjecture for graphs with small connectivity
Forbidden subgraphs that imply hamiltonian-connectedness
On a conjecture of wang and williams
Acyclic 4-Choosability of Planar Graphs with No 4- and 5-Cycles
Circular choosability of graphs
Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups
The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3
A linear Vizing-like relation relating the size and total domination number of a graph
Subdivisions of K 5 in Graphs Embedded on Surfaces With Face-Width at Least 5
Improvements on the density of maximal 1-planar graphs
Pancyclicity and extendability in strong products
Arc-transitive maps with underlying Rose Window graphs
Steiner centers in graphs
Corrigendum to 'flexible circuits in the d $d$-dimensional rigidity matroid'
Edge disjoint cycles in graphs
The square of a connected S(K 1, 3 )-free graph is vertex pancyclic
Independence trees and Hamilton cycles
Circular chromatic number of distance graphs with distance sets of cardinality 3
Convex excess in partial cubes
Excluding 4-Wheels
Regular bipartite graphs are antimagic
Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
The uniqueness of the strongly regular graph on 77 points
Lower bounds on the Erdős-Gyárfás problem via color energy graphs
Asymptotic confirmation of the Faudree-Lehel conjecture on irregularity strength for all but extreme degrees
Some remarks on domination
Extending partial representations of circle graphs
Domination in graphs with minimum degree two
Complete graph immersions and minimum degree
Efficient Winning Strategies in Random-Turn Maker-Breaker Games
Linear arboricity for graphs with multiple edges
On critically perfect graphs
Vertex-transitive graphs that are not Cayley graphs. II
Erratum to: The structure of geodetic blocks with diameter two
Circumference and Pathwidth of Highly Connected Graphs
On fans in multigraphs
The irredundant ramsey number s (3, 7)
The Generic Circular Triangle-Free Graph
The number of bipartite tournaments with a unique given factor
Cycles of even lengths modulo k
Long paths and large cycles in finite graphs
Perfect path double covers of graphs
Some observations on the oberwolfach problem
Automated testing and interactive construction of unavoidable sets for graph classes of small path-width
Edge-transitive cubic graphs of twice square-free order
On Perfect Matching Coverings and Even Subgraph Coverings
On bipartite-mixed graphs
Graphs embedded in the plane with a bounded number of accumulation points
On decomposing a graph into nontrivial bonds
Unique and faithful embeddings of projective-planar graphs
A tight upper bound on the average order of dominating sets of a graph
Pancyclic subgraphs of random graphs
Subcontraction-equivalence and Hadwiger's conjecture
Packing of spanning mixed arborescences
Smallest (1, 2)-eulerian weight and shortest cycle covering
Maximum directed cuts in acyclic digraphs
Graphs with Few 3-Cliques and 3-Anticliques are 3-Universal
On d -diagonal colorings
Longest cycles in tough graphs
A note concerning the chromatic index of multigraphs
The chromatic number of heptagraphs
On Some Algorithmic and Structural Results on Flames
Generating near-bipartite bricks
Arc-disjoint strong spanning subdigraphs of semicomplete compositions
Cycles in bipartite graphs and an application in number theory
Squares, clique graphs, and chordality
Hamilton decompositions of some line graphs
Large Induced Forests in Graphs
Shortness parameters for planar graphs with faces of only one type
Nonorientable genus of cartesian products of regular graphs
On unavoidable-induced subgraphs in large prime graphs
Low independence number and Hamiltonicity implies pancyclicity
Choosability of toroidal graphs without short cycles
A survey of χ-boundedness
Minimum cycle bases of Halin graphs
On (4, 2)-Choosable Graphs
NZ-flows in strong products of graphs
Projective-planar graphs with even duals
Infinite digraphs with nonreconstructible outvalency sequences
Ban-Linial's Conjecture and treelike snarks
Regular orientable embeddings of complete bipartite graphs
On Cheeger-type inequalities for weighted graphs
Face Sizes and the Connectivity of the Dual
Some remarks about factors of graphs
Domination numbers of planar graphs
Finding a shortest even hole in polynomial time
Cycles and paths in edge-colored graphs with given degrees
Edge-reconstruction of planar graphs with minimum valency 5
Subgraphs of a hypercube containing no small even cycles
Minimum degree and the graph removal lemma
Total chromatic number of planar graphs with maximum degree ten
Total Coloring Graphs With Large Maximum Degree
Finding dense minors using average degree
Acyclic edge coloring of graphs with maximum degree 4
An historical note: Euler's Königsberg letters
Ramsey-type results for Gallai colorings
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
When every k -cycle has at least f ( k ) chords
A class of self-complementary vertex-transitive digraphs
Circuit decompositions of join-covered graphs
The crossing number of K 3, n in a surface
Hamiltonicity of graphs perturbed by a random geometric graph
Graph-theoretic parameters concerning domination, independence, and irredundance
Random walks and the regeneration time
Packing paths in digraphs
An upper bound for the k -domination number of a graph
Note on projective graphs
Note on a new coloring number of a graph
Contractibility and NP-completeness
A new upper bound for the independence number of edge chromatic critical graphs
5-Coloring reconfiguration of planar graphs with no short odd cycles
A relaxation of the strong Bordeaux Conjecture
The 2-intersection number of paths and bounded-degree trees
Hourglasses and Hamilton cycles in 4-connected claw-free graphs
Infinitely many planar cubic hypohamiltonian graphs of girth 5
Sharp lower bounds for the number of maximum matchings in bipartite multigraphs
Sparse halves in K 4 -free graphs
On Serial Symmetric Exchanges of Matroid Bases
Partitioning a graph into two square-cycles
An algorithm for finding factorizations of complete graphs
Circular flows in mono-directed signed graphs
A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
Cyclically 5-edge-connected cubic planar graphs and shortness coefficients
Group labelings of graphs
The evasiveness conjecture and graphs on 2p vertices
Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph
On weights of induced paths and cycles in claw-free and K 1 , r -free graphs
A sufficient condition for a graph to contain three disjoint 1-factors
Hypercube subgraphs with local detours
Existence of proportional graphs
Quasi-carousel tournaments
Generalized designs on graphs: Sampling, spectra, symmetries
Minor-universal planar graphs without accumulation points
Disjoint clique cutsets in graphs without long holes
List coloring digraphs
Tree independence number I. (Even hole, diamond, pyramid)-free graphs
Acyclic edge coloring of 2-degenerate graphs
Coloring graph bundles
Circuits through prescribed edges
On the edge-coloring problem for a class of 4-regular maps
Rainbow coloring the cube
Maximum Order of Triangle-Free Graphs with a Given Rank
Node coverings with odd chains
Eigenvalue Approach to Dense Clusters in Hypergraphs
Decompositions of highly connected graphs into paths of length 3
An asymptotically tight bound on the adaptable chromatic number
A ramsey-type bound for rectangles
The 1-2-3-Conjecture for Hypergraphs
On light edges and triangles in projective planar graphs
Computation of the Folkman number F e (3, 3; 5)
Disjoint Paths in Decomposable Digraphs
On the maximum number of maximum independent sets in connected graphs
On the sum of all distances in a graph or digraph
Hamiltonicity and reversing arcs in digraphs
On Hamilton decompositions of infinite circulant graphs
A note on the line-distinguishing chromatic number and the chromatic index of a graph
A characterization of the subcubic graphs achieving equality in the Haxell-Scott lower bound for the matching number
On paul turán's influence on graph theory
Longest cycles and their chords
Diagonal 11-coloring of plane triangulations
Arc reversal in nonhamiltonian circulant oriented graphs
Clique coloring of dense random graphs
Berge-Fulkerson coloring for C(8)-linked graphs
The embeddings of a graph - A survey
Generalized hamiltonian circuits in the cartesian product of two-directed cycles
Existence of Δ λ -cycles and Δ λ -paths
On the existence and the enumeration of bipartite regular representations of Cayley graphs over abelian groups
Vertex suppression in 3-connected graphs
Making a tournament k $k$-strong
Ramsey numbers for multiple copies of sparse graphs
On an adjacency property of graphs
Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
On graphs with strongly independent color-classes
Cycle spaces in topological spaces
Double cycle covers and the petersen graph
A lower bound for the crossing number of C m × C n
Some graphs with characteristic polynomials which are not solvable by radicals
Five-cycle double cover and shortest cycle cover
Induced subgraphs and well-quasi-ordering
Hamiltonian weights and unique 3-edge-colorings of cubic graphs
A remark on the factor theorems of lovász and tutte
Acyclic edge colorings of graphs
On bounded automorphisms of locally finite transitive graphs
The Erdős-Gyárfás function with respect to Gallai-colorings
χ-bounded families of oriented graphs
Quartic graphs with minimum spectral gap
Improved lower bounds on k -independence
Degree Sums and Covering Cycles
Odd covers of graphs
All minimum C 5 -saturated graphs
Simultaneous intersection representation of pairs of graphs
Local version of Vizing's theorem for multigraphs
Connectivity, graph minors, and subgraph multiplicity
Nowhere-zero 3-flow and -connectedness in graphs with four edge-disjoint spanning trees
On graphs and algebraic graphs that do not contain cycles of length 4
Partitioning digraphs with outdegree at least 4
How to deal with unlabeled random graphs
A structure theorem for graphs with no cycle with a unique chord and its consequences
A generalization of perfect graphs - i -perfect graphs
List-Coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles
Highly connected triples and Mader's conjecture
On the equality of the grundy and ochromatic numbers of a graph
The Arc-Weighted Version of the Second Neighborhood Conjecture
Star-factors of tournaments
Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph
Upper total domination in claw-free graphs
On Cui-Kano's Characterization Problem on Graph Factors
Ore-type degree conditions for a graph to be H -linked
On smallest regular graphs with a given isopart
Non-Cayley-isomorphic self-complementary circulant graphs
Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs
On the number of hamiltonian cycles in triangulations with few separating triangles
On the maximum number of pairwise compatible euler cycles
Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles
Excluding pairs of tournaments
On the imaginary parts of chromatic roots
List Colorings of K 5-Minor-Free Graphs With Special List Assignments
On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós
Binding number and minimum degree for k-factors
Monotone drawings of planar graphs
The domination numbers of the 5 × n and 6 × n grid graphs
3-Coloring Triangle-Free Planar Graphs with a Precolored 8-Cycle