yusuke1997/dblp-id-title huggingface dataset:
Two Stability Theorems for Kℓ+1r-Saturated Hypergraphs
Face colorings of embedded graphs
Embedding a Graph-Like Continuum in Some Surface
Connectivity keeping trees in k -connected graphs
Bidegreed graphs are edge reconstructible
Extremal Results on Disjoint Cycles in Tournaments and Bipartite Tournaments
Gomory-Hu trees of infinite graphs with finite total weight
Structural theorem on plane graphs with application to the entire coloring number
Homage to roberto frucht
Covering 2-connected 3-regular graphs with disjoint paths
Forbidden minors for wye-delta-wye reducibility
On the structure and clique-width of ( 4 K 1 , C 4 , C 6 , C 7 ) -free graphs
Regular graphs with given girth pair
Forbidden subgraphs and the existence of a 2-factor
Hamilton cycles in claw-free graphs
A graph-theoretic version of the union-closed sets conjecture
Toughness and the existence of k -factors
Cubic vertices in planar hypohamiltonian graphs
Proof of Mader's conjecture on k -critical n -connected graphs
On the complexity of the circular chromatic number
Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
Total choosability of multicircuits II
Chromatic polynomials, polygon trees, and outerplanar graphs
Hamiltonian circuits in N 2 -locally connected K 1, 3 -free graphs
Concentration of hitting times in Erdős-Rényi graphs
A sufficient condition for a digraph to be kernel-perfect
On three zero-sum Ramsey-type problems
Ubiquity of graphs with nowhere-linear end structure
Matchings in k-partite k-uniform hypergraphs
On the Local Profiles of Trees
On zero-trees
Bounds for the vertex linear arboricity
Zip product of graphs and crossing numbers
Interval Tournaments
Line pseudodigraphs
Infinite paths in planar graphs III, 1-way infinite paths
An upper bound on the ramsey number R ( K 3 , G ) depending only on the size of the graph G
Minimal braces
Disjoint quasi-kernels in digraphs
On possible counterexamples to Negami's planar cover conjecture
Even and odd holes in cap-free graphs
Sequentially embeddable graphs
On stability of the hamiltonian index under contractions and closures
Cycles with two blocks in k-chromatic digraphs
On local connectivity of graphs with given clique number
Minimum Non-Chromatic-λ-Choosable Graphs
On the crossing numbers of products of cycles and graphs of order four
Which line-graphs are perfectly orderable?
Sufficient conditions for lambda'-optimality in graphs with girth g
Mean distance and minimum degree
Some classes of perfectly orderable graphs
Circumferences of k -connected graphs involving independence numbers
Even graphs
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected?
Maximum chromatic polynomials of 2-connected graphs
Backbone colorings for graphs: Tree and path backbones
Parity theorems for paths and cycles in graphs
Note on the n th chromatic numbers of the Grötzsch graph
Isometric subgraphs for Steiner distance
A unified approach to construct snarks with circular flow number 5
Graphs of low average degree without independent transversals
Counterexamples to two conjectures of Hilton
The strong fractional choice number of 3-choice-critical graphs
On the interval number of special graphs
An Upper Bound for the Excessive Index of an r -Graph
A subquadratic algorithm for the simultaneous conjugacy problem
4-Coloring P 6 -Free Graphs with No Induced 5-Cycles
SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs
Disproof of a conjecture about independent branchings in k -connected directed graphs
Pancyclicity of 4-Connected, Claw-Free, P 10-Free Graphs
Planar Digraphs without Large Acyclic Sets
Tearing a strip off the plane
On Min-Bisections of Graphs
J. Howard Redfield 1879-1944
New Ore-Type Conditions for H -Linked Graphs
Counterexamples to the List Square Coloring Conjecture
Doubly eulerian trails on rectangular grids
A note on the star chromatic number
Between ends and fibers
Classes of interval graphs under expanding length restrictions
A dichotomy for the kernel by H-walks problem in digraphs
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
Perfect forests in graphs and their extensions
On avoidable and unavoidable trees
On irredundant Ramsey numbers for graphs
Three-regular subgraphs of four-regular graphs
A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition
Edge-decomposing graphs into coprime forests
Stability of Hereditary Graph Classes Under Closure Operations
Even cycle creating paths
On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations
Extremal C 4 -Free/ C 5 -Free Planar Graphs
Smallest Vertex-Transitive Graphs of Given Degree and Diameter
Proper-walk connection number of graphs
Extremal problems concerning transformations of the edges of the complete hypergraphs
On deeply critical oriented cliques
Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge
A note on minimum graphs with girth pair (4, 2 l + 1)
Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths
Channel assignment on Cayley graphs
Color degree and monochromatic degree conditions for short properly colored cycles in edge-colored graphs
Construction of uniquely H -colorable graphs
Six-flows on almost balanced signed graphs
The structure of geodetic blocks with diameter two
Extremal maximal uniquely hamiltonian graphs
Limits of Near-Coloring of Sparse Graphs
Pancyclic arcs and connectivity in tournaments
Ramsey Results for Cycle Spectra
Orderly algorithms for generating restricted classes of graphs
On generalized graph colorings
Path Separation by Short Cycles
Constructing trees in graphs with no K 2, s
On Ramsey numbers involving starlike multipartite graphs
Perfect matchings and derangements on graphs
On the average genus of the random graph
4-valent graphs
An approach to hedetniemi's conjecture
On the possible values of the entropy of undirected graphs
Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
Duality theorems for stars and combs I: Arbitrary stars and combs
Forbidden subgraphs and bounds on the size of a maximum matching
Strong immersion is a well-quasi-ordering for semicomplete digraphs
Decompositions of Graphs into Fans and Single Edges
On regular self-complementary graphs
Bipartite multigraphs with 1-factors containing specified edges
On the number of triangular embeddings of complete graphs and complete tripartite graphs
Clique-convergence is undecidable for automatic graphs
Characterizing vertex-transitive pq -graphs with an imprimitive automorphism subgroup
Polynomial Characterizations of Distance-Biregular Graphs
Oriented discrepancy of Hamilton cycles
A necessary and sufficient condition for the star decomposition of complete graphs
Every graph occurs as an induced subgraph of some hypohamiltonian graph
New expressions for order polynomials and chromatic polynomials
On the irregularity strength of trees
Erratum to "Acyclic Edge Chromatic Number of Outerplanar Graphs"
Edge colorings of complete graphs without tricolored triangles
Strongly perfect claw-free graphs - A short proof
On self-complementation
On Lower Bounds for the Matching Number of Subcubic Graphs
Cycles intersecting a prescribed vertex set
On chromatic uniqueness of two infinite families of graphs
Digraphs with the path-merging property
The six bidecomposable graphs
Equitable edge-colorings of simple graphs
Further annotated bibliography on the isomorphism disease
P 4 -decompositions of regular graphs
On wing-perfect graphs
Packing Countably Many Branchings with Prescribed Root-Sets in Infinite Digraphs
On brittle graphs
Strong chromatic index and Hadwiger number
Complete graphs with no rainbow path
Graphic sequences that have a realization with large clique number
Strengthening Erdös-Pósa property for minor-closed graph classes
A graph which is edge transitive but not arc transitive
Vertex-disjoint paths and edge-disjoint branchings in directed graphs
Walks through every edge exactly twice
Hamiltonian line graphs
Strong Chromatic Index of Sparse Graphs
Transforming trees by successive local complementations
Recognizing interval bigraphs by forbidden patterns
Stability-type results for hereditary properties
Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
Graphs with the unique path property: Structure, cycles, factors, and constructions
Biclosure and bistability in a balanced bipartite graph
Stability of arc-transitive graphs
The chromatic covering number of a graph
Critical properties of bipartite permutation graphs
On 2-factors of a bipartite graph
Extremal cover times for random walks on trees
Acyclic list 7-coloring of planar graphs
Mapping Planar Graphs into Projective Cubes
On the Complexity of Computing the Excessive [ B ]-Index of a Graph
A unified approach to known and unknown cases of Berge's conjecture
Stability from graph symmetrization arguments in generalized Turán problems
Crossing numbers of imbalanced graphs
Adapted list coloring of planar graphs
A note on the width of sparse random graphs
Ramsey unsaturated and saturated graphs
Subdivisions and the chromatic index of r -graphs
An Euler-genus approach to the calculation of the crosscap-number polynomial
Balanced Independent Sets and Colorings of Hypergraphs
End-faithful spanning trees in T 1 -free graphs
Kuratowski's theorem
Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a Graph
Counting paths, cycles, and blow-ups in planar graphs
Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
Extremal graphs for odd wheels
On Moore bipartite digraphs
A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs
Colorings versus list colorings of uniform hypergraphs
Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph
The Adaptable Chromatic Number and the Chromatic Number
Extremal graphs with bounded densities of small subgraphs
Books Versus triangles
Single-conflict colouring
Some small ramsey numbers
Transitive tournaments and self-complementary graphs
A note of welcome
Separating the Edges of a Graph by Cycles and by Subdivisions of K4
Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs
χ-bounds, operations, and chords
Bi-arc graphs and the complexity of list homomorphisms
A degree condition for a graph to have [ a , b ]-factors
The crossing number of K 1, 3, n and K 2, 3, n
The maximum number of odd cycles in a planar graph
6-regular 4-critical graph
Symmetries of the honeycomb toroidal graphs
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
Wing-triangulated graphs are perfect
On Neighbor-Distinguishing Index of Planar Graphs
Diameter bounds for altered graphs
List Edge-Coloring and Total Coloring in Graphs of Low Treewidth
Circle graph obstructions under pivoting
Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs
On strongly almost trivial embeddings of graphs
Extensions of some factorization results from simple graphs to multigraphs
On a conjecture of erdöus, simonovits, and sós concerning anti-Ramsey theorems
On the structure of unbreakable graphs
Two maps with large representativity on one surface
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
On the Erdös-Sós conjecture
On covering bridged plane triangulations with balls
On strongly regular self - complementary graphs
Decomposing C4-free graphs under degree constraints
Strong coloring 2-regular graphs: Cycle restrictions and partial colorings
A lower bound for r(5, 5)
Some recent results in hamiltonian graphs
Generating simple near-bipartite bricks
Constructing isospectral non-isomorphic digraphs from hypergraphs
Isometric copies of directed trees in orientations of graphs
Decycling graphs
K 4, 4 - e has no finite planar cover
Minimally 2-edge connected graphs
Covering a graph with cycles passing through given edges
Chromatic-index-critical graphs of even order
Generalized degree conditions for graphs with bounded independence number
The average degree of a subcubic edge?chromatic critical graph
Multiplicity of the second-largest eigenvalue of a planar graph
Independence number of edge-chromatic critical graphs
Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision
Graph Decompositions Satisfying Extremal Degree Constraints
R(5, 5) ≤ 48
A characterization of partially dual graphs
Good orientations of unions of edge-disjoint spanning trees
Combinatorial theorems about embedding trees on the real line
Almost-regular factorization of graphs
Generating weakly triangulated graphs
Euclidean Ramsey theorems on the n -sphere
A Note on Sub-Eulerian Graphs
The 3-connected graphs having a longest cycle containing only three contractible edges
Some results and problems on clique coverings of hypergraphs
Maximum acyclic and fragmented sets in regular graphs
Perfect matchings in random subgraphs of regular bipartite graphs
Knots and links in spatial graphs
Geometric graph homomorphisms
2-Distance Coloring of Sparse Graphs
On construction for trees making the equality hold in Vizing's conjecture
Almost all 5-regular graphs have a 3-flow
Clique-width: Harnessing the power of atoms
An attempt to understand the four color problem
Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface
Rooted induced trees in triangle-free graphs
Cores of class II graphs
Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
Vertex colorings of graphs without short odd cycles
Antimagic Properties of Graphs with Large Maximum Degree
On the minimum number of edge-disjoint complete m -partite subgraphs into which K n can be decomposed
Total matchings and total coverings of graphs
Ramsey theory and Ramsey theoreticians
A generalization of line graphs: ( X, Y )-intersection graphs
The complete bipartite graphs with a unique edge-transitive embedding
On a list coloring conjecture of Reed
Spectrum of the 1-Laplacian and Cheeger's Constant on Graphs
Relationships between total domination, order, size, and maximum degree of graphs
Competitive inheritance and limitedness of graphs
On the number of shredders
Duality theorems for stars and combs II: Dominating stars and dominated combs
On topological tournaments of order 4 in digraphs of outdegree 3
Degree conditions for k -ordered hamiltonian graphs
Hamiltonicity of regular 2-connected graphs
Graphs with at most two moplexes
Vertex transversals that dominate
On planar hypohamiltonian graphs
Convexity of degree sequences
Extremal results for rooted minor problems
A note on defective colorings of graphs in surfaces
Minors in large almost-5-connected non-planar graphs
Locally s -distance transitive graphs
Turán problems for integer-weighted graphs
Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs
Edge-face coloring of plane graphs with maximum degree nine
DAG-Width and Circumference of Digraphs
On Tournament Inversion
Regular factors in K 1, n free graphs
Pairs and triples of forbidden subgraphs and the existence of a 2-factor
Closure and stable Hamiltonian properties in claw-free graphs
Planar hypohamiltonian oriented graphs
On ramsey numbers for books
Flexible list colorings in graphs with special degeneracy conditions
Tight lower bounds on the matching number in a graph with given maximum degree
On equality in an upper bound for domination parameters of graphs
On the editing distance of graphs
Toughness, trees, and walks
On the Structure of Graphs with Given Odd Girth and Large Minimum Degree
Factorizations of regular graphs of high degree
Search algorithm for Ramsey graphs by union of group orbits
A short proof of König's matching theorem
Unavoidable parallel minors of 4-connected graphs
Orienting Triangulations
Forbidden subgraphs and 2-factors in 3/2-tough graphs
Simple versus nonsimple loops on random regular graphs
Edge Kempe equivalence of regular graph covers
Pagenumber of complete bipartite graphs
Meyniel's conjecture on graphs of bounded degree
Forest formulas of discrete Green's functions
Arc-Disjoint Directed and Undirected Cycles in Digraphs
Some connected ramsey numbers
Endpoint extendable paths in tournaments
Which rational numbers are binding numbers?
Ramsey-type results for oriented trees
Covers and strong covers in directed bipartite graphs
Average degree and contractibility
Rainbow faces in edge-colored plane graphs
d -Regular graphs of acyclic chromatic index at least d +2
Turán's theorem and k -connected graphs
A generalization of Turán's theorem
The Erdös-Hajnal Conjecture - A Survey
Special monochromatic trees in two-colored complete graphs
On a Ramsey-type problem
The Ramsey numbers of two sets of cycles
Vertex pancyclic in-tournaments
Star chromatic number
Congruence of cycle lengths and chromatic number
A class of Hamiltonian regular graphs
The spanning subgraphs of eulerian graphs
Quasi-graphic matroids
Refining Tree-Decompositions so That They Display the k -Blocks
On constructible graphs, locally Helly graphs, and convexity
(2 + ϵ)-Coloring of planar graphs with large odd-girth
MaxCut on permutation graphs is NP-complete
Covering contractible edges in 3-connected graphs. II. Characterizing those with covers of size three
Extending a partial nowhere-zero 4-flow
C 10 Has Positive Turán Density in the Hypercube
A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs
Pseudo-random properties of self-complementary symmetric graphs
Domination in planar graphs with small diameter
On the critical point-arboricity graphs
Circular Chromatic Indices of Regular Graphs
Infinite median graphs, (0, 2)-graphs, and hypercubes
The threshold weight of a graph
Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles
Graph operations and upper bounds on graph homomorphism counts
An application of the regularity lemma in generalized Ramsey theory
An excluded minor theorem for the octahedron
The combinatorial map color theorem
Classification of certain subgraphs of the 3-dimensional grid
Polynomial relations between matrices of graphs
Inducibility in the hypercube
A counterexample to Seymour's self-minor conjecture
Existence of spanning and dominating trails and circuits
Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments
A Nordhaus-Gaddum Problem for the Spectral Gap of a Graph
Defective acyclic colorings of planar graphs
Isomorphism criterion for monomial graphs
Tension polynomials of graphs
Disjoint cycles with chords in graphs
On supersaturation and stability for generalized Turán problems
On a conjecture that strengthens Kundu's k k -factor theorem
Supereulerian Oriented Graphs With Large Arc-Strong Connectivity
Chromatic number is Ramsey distinguishing
A Graph with cover degeneracy less than chromatic number
Pancyclic oriented graphs
A degree condition for the circumference of a graph
Lower bounds on the number of triangles in a graph
Removable edges in 3-connected graphs
On the Number of k -Dominating Independent Sets
On the edge-biclique graph and the iterated edge-biclique operator
Girth, minimum degree, and circumference
A linear vizing-like relation between the size and the domination number of a graph
On Ramsey-type positional games
Decomposition of Graphs into (k, r)-Fans and Single Edges
Group chromatic number of planar graphs of girth at least 4
Seurat games on Stockmeyer graphs
Covering contractible edges in 3-connected graphs. I: Covers of size three are cutsets
The 2-surviving rate of planar graphs with average degree lower than
Graphs with girth 2 ℓ + 1 $2\ell +1$ and without longer odd holes are 3-colorable
Acyclic graphs with at least 2ℓ + 1 vertices are ℓ-recognizable
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
Neighborhood unions and hamilton cycles
Some new bounds for the maximum number of vertex colorings of a ( v , e )-graph
The giant component after percolation of product graphs
On tree factorizations of K n
The Merrifield-Simmons Conjecture Holds for Bipartite Graphs
Laplacian and vibrational spectra for homogeneous graphs
Partitioning kite-free planar graphs into two forests
The star chromatic number of a graph
Circuits in cayley digraphs of finite abelian groups
On the list color function threshold
On the Neighbor Sum Distinguishing Index of Planar Graphs
Chromatic polynomials and whitney's broken circuits
Partitions of hypergraphs under variable degeneracy constraints
On the irregularity strength of the m × n grid
Independent Sets of Random Trees and Sparse Random Graphs
Diameters of finite upper half plane graphs
On proulx's four exceptional toroidal groups
Correction to "Sharp threshold for embedding balanced spanning trees in random geometric graphs"
Infinite paths in planar graphs V, 3-indivisible graphs
One-diregular subgraphs in semicomplete multipartite digraphs
On k -ordered Hamiltonian graphs
A conjecture of Borodin and a coloring of Grünbaum
Graphs Containing Topological H
( d , 1)-total labeling of graphs with a given maximum average degree
Claw-decompositions and tutte-orientations
Miscellaneous problems on infinite graphs
On homeomorphically irreducible spanning trees in cubic graphs
On the asymptotic structure of sparse triangle free graphs
The structure and maximum number of maximum independent sets in trees
Sequences realizable by maximal k -degenerate graphs
The reconstruction conjecture is true if all 2-connected graphs are reconstructible
Bounding the Clique-Width of H -Free Chordal Graphs
On vertex partitions and some minor-monotone graph parameters
Size Ramsey numbers for small-order graphs
Counting double covers of graphs
On H -immersions
Proximity thresholds for matching extension in planar and projective planar triangulations
A Hypercube Variant with Small Diameter
Note on Perfect Forests
On the distance matrix of a directed graph
Interval Minors of Complete Bipartite Graphs
On graphs whose line graphs have crossing number one
On Turán problems with bounded matching number
Saturation numbers for families of graph subdivisions
A new proof of the 6 color theorem
Degree sums and graphs that are not covered by two cycles
On unavoidable digraphs in orientations of graphs
Dynamic choosability of triangle-free graphs and sparse random graphs
Building fences around the chromatic coefficients
A note on graphs spanned by Eulerian graphs
R (4, 5) = 25
Edge proximity conditions for extendability in cubic bipartite graphs
The diameter of domination k -critical graphs
Counterexamples to Gerbner's conjecture on stability of maximal F-free graphs
Some new perfect one-factorizations from starters in finite fields
The number of edge colorings with no monochromatic triangle
Intersection representation of digraphs in trees with few leaves
The linear arboricity of some regular graphs
A Construction of a 3/2-Tough Plane Triangulation With No 2-Factor
A note on minor antichains of uncountable graphs
Niche graphs and mixed pair graphs of tournaments
A result on Hamiltonian line graphs involving restrictions on induced subgraphs
Bichromaticity of bipartite graphs
Switching reconstruction of digraphs
A cubic 3-connected graph having no cycle through given 10 vertices has the "Petersen form"
Edge-minimum saturated k-planar drawings
Some conditions implying stability of graphs
Directed star decompositions of the complete directed graph
Exponentially many 4-list-colorings of triangle-free graphs on surfaces
Embedding edge-colorings into 2-edge-connected k -factorizations of k kn+1
An intermediate value theorem for graphs with given automorphism group
SGDs with doubly transitive automorphism group
The number of shortest cycles and the chromatic uniqueness of a graph
On totally multicolored stars
Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result
Number of labeled 4-regular graphs
Arc-disjoint arborescences of digraphs
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs
Circuit Covers of Signed Graphs
Linear Ramsey numbers of sparse graphs
On Maximum Edge Cuts of Connected Digraphs
Threshold for stability of weak saturation