yusuke1997/dblp-id-title huggingface dataset:
On the maximum number of edges in a c 4 -free subgraph of q n
On feedback vertex sets and nonseparating independent sets in cubic graphs
Induced matchings in cubic graphs
Recognizing decomposable graphs
Hadwiger's conjecture for quasi-line graphs
Stability for large forbidden subgraphs
Spanning bipartite quadrangulations of even triangulations
The chromatic index of complete multipartite graphs
Chasing a Fast Robber on Planar Graphs and Random Graphs
On the homogeneous representation of interval graphs
Edge-colorings avoiding rainbow stars
Extremal spectral results of planar graphs without vertex-disjoint cycles
On 3-polytopes with non-Hamiltonian prisms
The generalized Randic index of trees
On supercompact graphs
Long dominating cycles and paths in graphs with large neighborhood unions
A variant of the Erdős-Sós conjecture
Chromatic roots at 2 and the Beraha number B 10
Game coloring the Cartesian product of graphs
Large families of mutually embeddable vertex-transitive graphs
The Monochromatic Circumference of 2-Edge-Colored Graphs
On graphs with no induced five-vertex path or paraglider
Bounds for the crossing number of the N -cube
Multichromatic numbers, star chromatic numbers and Kneser graphs
Trees and unicyclic graphs with hamiltonian path graphs
Vertex Cuts
A complete bipartite graph without properly colored cycles of length four
A Kuratowski theorem for the projective plane
Homomorphisms of Signed Graphs
Unavoidable cycle lengths in graphs
Weakly pancyclic graphs
Constructing cubic edge- but not vertex-transitive graphs
Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring
Integer flows
The Ramsey number of loose cycles versus cliques
On induced subgraph of Cartesian product of paths
Finding paths between 3-colorings
On the eulericity of a graph
Irredundance perfect and P 6 -free graphs
Minimal non-neighborhood-perfect graphs
Parity Linkage and the Erdős-Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs
When bad things happen to good trees
Induced embeddings in Steinhaus graphs
On stable crossing numbers
A Structure Theorem for Strong Immersions
Acyclic and oriented chromatic numbers of graphs
Projective-Planar Graphs with no K 3, 4 -Minor. II
A note on uniquely 10-colorable graphs
Weakly Hamiltonian-connected locally semicomplete digraphs
The size of graphs without nowhere-zero 4-flows
Connectivity of circulant digraphs
Counting the 10-point graphs by partition
Deploying Robots With Two Sensors in K 1, 6 -Free Graphs
Existence of graphs with prescribed mean distance
A tight bound for independent domination of cubic graphs without 4-cycles
The maximum number of edges in a minimal graph of diameter 2
On super-edge-connected digraphs and bipartite digraphs
On some minimal graphs of the torus
Minimum Degrees of Minimal Ramsey Graphs for Almost-Cliques
Edge Colorings and Circular Flow Numbers of Regular Graphs
Finite fields and the 1-chromatic number of orientable surfaces
Anti-Ramsey number of expansions of paths and cycles in uniform hypergraphs
The structure of (theta, pyramid, 1-wheel, 3-wheel)-free graphs
Subgraphs in vertex neighborhoods of K r -free graphs
A characterization of graphs without long induced paths
The orders of graphs with prescribed degree sets
k -shredders in k -connected graphs
Hamilton cycles in strong products of graphs
A Reconfigurations Analogue of Brooks' Theorem and Its Consequences
Proper orientation number of triangle-free bridgeless outerplanar graphs
Some results on cyclic interval edge colorings of graphs
Realization of digraphs by preferences based on distances in graphs
Chromatic factorizations of a graph
The structure of graphs with no K 3 , 3 immersion
Chordal graphs, interval graphs, and wqo
New upper bounds for the chromatic number of a graph
A new characterization of graphs based on interception relations
Complexity of approximating the oriented diameter of chordal graphs
Signed graph factors and degree sequences
Antimagic orientation of graphs with minimum degree at least 33
Erdös-Hajnal conjecture for new infinite families of tournaments
Highly irregular graphs
Characterizing circular colouring mixing for p q 4 $\frac{p}{q}\lt 4$
On the hamiltonicity of a planar graph and its vertex-deleted subgraphs
The maximum number of pentagons in a planar graph
A connection between a convex programming problem and the LYM property on perfect graphs
On Line Graphs with Crossing Number 1
Eulerian partial duals of plane graphs
Classification of the toroidal groups
Complete directed minors and chromatic number
Packing odd T -joins with at most two terminals
Snarks with given real flow numbers
Graphs with exactly one hamiltonian circuit
A Harnack inequality for Dirichlet eigenvalues
Spanning caterpillars of a hypercube
Maximal Degrees in Subgraphs of Kneser Graphs
Improved bounds for the oriented radius of mixed multigraphs
On the maximum number of odd cycles in graphs without smaller odd cycles
The mod k $k$ chromatic index of random graphs
On distance r?dominating and 2r?independent sets in sparse graphs
Infinite paths in planar graphs IV, dividing cycles
On the saturation spectrum of odd cycles
Connected subgraphs with small degree sums in 3-connected planar graphs
Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture
Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
Every connected, locally connected graph is upper embeddable
A counterexample to a conjecture on the chromatic number of r $r$-stable Kneser hypergraphs
Multiple vertex coverings by specified induced subgraphs
Hadwiger number and chromatic number for near regular degree sequences
On Stockmeyer's non-reconstructible tournaments
A Note on the Order of Iterated Line Digraphs
On Seymour's and Sullivan's second neighbourhood conjectures
Tight Upper Bound on the Clique Size in the Square of 2-Degenerate Graphs
Decomposing subcubic graphs into claws, paths or triangles
Vertex partitions and maximum degenerate subgraphs
On Tight (k,ℓ)-Stable Graphs
N-extendability of symmetric graphs
Enumerative problems for arborescences and monotone paths on polytope graphs
On 5-Cycles and 6-Cycles in Regular n-Tournaments
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
Hamiltonian threshold for strong products of graphs
Bad list assignments for non-k $k$-choosable k $k$-chromatic graphs with 2k+2 $2k+2$-vertices
Identifying Codes in Line Graphs
The number of maximal independent sets in connected graphs
Characterizing path graphs by forbidden induced subgraphs
Treewidth of the Line Graph of a Complete Graph
New bounds on the edge number of a k -map graph
Longest paths and cycles in K 1, 3 -free graphs
A lower bound for the complex flow number of a graph: A geometric approach
Hamilton cycles in regular graphs
Even Embeddings of the Complete Graphs and Their Cycle Parities
Circuits through prescribed vertices in k -connected k -regular graphs
Circumference and girth
Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function
Hereditary Efficiently Dominatable Graphs
Growth rates of the bipartite Erdős-Gyárfás function
The divisibility theorem for isomorphic factorizations of complete graphs
Hamiltonian cycles in bipartite quadrangulations on the torus
An upper bound on the length of a Hamiltonian walk of a maximal planar graph
Pathwidth of outerplanar graphs
On decomposition of triangle-free graphs under degree constraints
A note on the girth-doubling construction for polygonal graphs
On the mean subtree order of graphs under edge addition
Constrained Ramsey numbers of graphs
Enumeration of graphs by degree sequence
Two Questions of Erdős on Hypergraphs above the Turán Threshold
Coloring quasi-line graphs
Component factors and induced subgraphs
Pancyclic and panconnected line graphs
Turán- and Ramsey-type results for unavoidable subgraphs
Graphs characterized by the second eigenvalue
The crossing number of C 5 × C n
Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations
The effect of symmetry-preserving operations on 3-connectivity
Independent dominating sets and hamiltonian cycles
Hamiltonian cycles in cayley color graphs
Packing and covering constants for certain families of trees. I
Spanning trees with many leaves
Degree sequence conditions for maximally edge-connected graphs and digraphs
Oriented diameter of maximal outerplanar graphs
Factorizations of complete multipartite graphs into generalized cubes
The acyclic edge chromatic number of a random d -regular graph is d + 1
Disjoint T -paths in tough graphs
A characterization of α-outerplanar graphs
Polynomial bounds for chromatic number. III. Excluding a double star
Generating all planer graphs regular of degree four
On the number of linear hypergraphs of large girth
The list colouring constants
Bounding the number of embeddings of 5-connected projective-planar graphs
Odd 4-edge-colorability of graphs
Two-factors each component of which contains a specified vertex
The chromatic index of graphs of even order with many edges
Edge-reconstruction of 4-connected planar graphs
Vertex Partitions of Graphs into Cographs and Stars
Characterization of edge-colored complete graphs with properly colored Hamilton paths
Forcing a K r minor by high external connectivity
Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees
A note on a conjecture about cycles with many incident chords
Arc-Disjoint Paths in Decomposable Digraphs
Bounding the tripartite-circle crossing number of complete tripartite graphs
Perfect k -line graphs and k -total graphs
Conservative graphs
Normal cirulant graphs with noncyclic regular subroups
Pursuit - Evasion games on graphs
On r -Connected Graphs with No Semi-topological r -Wheel
Intersections of graphs
Wiggles and Finitely Discontinuous k -to-1 Functions Between Graphs
A constructive characterisation of circuits in the simple (2, 1)-sparse matroid
Self-avoiding walks and polygons on hyperbolic graphs
Bigraphs versus digraphs via matrices
The Set of Circular Flow Numbers of Regular Graphs
Bounds related to domination in graphs with minimum degree two
Ulam, the man and the mathematician
On the conjecture for certain Laplacian integral spectrum of graphs
Gallai-Ramsey number for K 4
Density of the circular chromatic numbers of series-parallel graphs
Re-embedding structures of 4-connected projective-planar graphs
The spectrum problem for the Petersen graph
A tanglegram Kuratowski theorem
More on foxes
Upper bounds for ramsey numbers R(3, 3, ⋖, 3) and Schur numbers
The ramsey number r ( k 1 + c 4 , k 5 - e )
A note on group colorings
Maximum Δ-edge-colorable subgraphs of class II graphs
Centroids and medians of finite metric spaces
Locally semicomplete digraphs: A generalization of tournaments
On the Ramsey number of trees versus graphs with large clique number
Coloring Triple Systems with Local Conditions
On a conjecture about the generalized exponent of primitive matrices
Hamiltonian graphs with neighborhood intersections
Theorem on directed graphs, applicable to logic
Explicit constructions of triple systems for Ramsey-Turán problems
Topologically 4-chromatic graphs and signatures of odd cycles
Circular chromatic numbers of some reduced Kneser graphs
Maximal antiramsey graphs and the strong chromatic number
Graphs with unavoidable subgraphs with large degrees
A reduction criterion for supereulerian graphs
On String Graph Limits and the Structure of a Typical String Graph
Decomposing planar graphs into graphs with degree restrictions
A new proof of menger's theorem
Applications of balance equations to vertex switching reconstruction
The w -median of a connected strongly chordal graph
On the structure of (pan, even hole)-free graphs
On a graph of O'Keefe and wong
Maximum packings of the complete graph with uniform length cycles
General Parity Result and Cycle-Plus-Triangles Graphs
Acrylic improper colorings of graphs
Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups
The circular chromatic number of a digraph
Graphic Sequences Have Realizations Containing Bisections of Large Degree
Sufficient conditions for a digraph to be Hamiltonian
Bipartite density and the independence ratio
Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube
The star-chromatic number of planar graphs
Generating all 3-connected 4-regular planar graphs from the octahedron graph
Cataloguing the graphs on 10 vertices
Star chromatic numbers of some planar graphs
On the Thomassen's conjecture
Conflict-free chromatic number versus conflict-free chromatic index
On partitioning the edges of graphs into connected subgraphs
Some arrowing results for trees versus complete graphs
Low Polynomial Exclusion of Planar Graph Patterns
On graph invariants satisfying the deletion-contraction formula
The strong clique index of a graph with forbidden cycles
A construction of chromatic index critical graphs
Tournament games and positive tournaments
Moments of graphs in monotone families
A sharp edge bound on the interval number of a graph
Critical groups for complete multipartite graphs and Cartesian products of complete graphs
The average degree of an edge-chromatic critical graph II
An ( F 1 , F 4 ) -partition of graphs with low genus and girth at least 6
On 4-cycles in random bipartite tournaments
Light paths in 4-connected graphs in the plane and other surfaces
Path coverings with paths
Interval coloring of (3, 4)-biregular bipartite graphs having large cubic subgraphs
Vertex disjoint equivalent subgraphs of order 3
Triangle-free planar graphs with the smallest independence number
The complexity of the matching-cut problem for planar graphs and other graph classes
More than one tough chordal planar graphs are Hamiltonian
Subcubic Edge-Chromatic Critical Graphs Have Many Edges
Switching Reconstruction of Digraphs
Small maximal matchings of random cubic graphs
Circular choosability via combinatorial Nullstellensatz
A separation property of planar triangulations
Extremal total distance of graphs of given radius I
A counterexample to the lights out problem
Infinite paths in planar graphs II, structures and ladder nets
On k -saturated graphs with restrictions on the degrees
List strong linear 2-arboricity of sparse graphs
Pebbling and optimal pebbling in graphs
On Graphs With No Induced P5 or K5-e
Toughness, minimum degree, and the existence of 2-factors
Petals and books: The largest Laplacian spectral gap from 1
A bound on the chromatic number using the longest odd cycle length
Interval digraphs: An analogue of interval graphs
Heroes in oriented complete multipartite graphs
Proximity-preserving labeling schemes
Hexagon-free subgraphs of hypercubes
Four classes of perfectly orderable graphs
Orientations of hamiltonian cycles in large digraphs
A dirac-type theorem for squares of graphs
New constructions of hypohamiltonian and hypotraceable graphs
Long cycles and spanning subgraphs of locally maximal 1-planar graphs
Graphs with independent perfect matchings
Graphs omitting sums of complete graphs
On resolvable tree-decompositions of complete graphs
From topology to algebra
Edge precoloring extension of hypercubes
The growth rate of the harmonious chromatic number
Some remarks on Arc-connectivity, vertex splitting, and orientation in graphs and digraphs
Enumeration and generation of a class of regular digraphs
Circumference of a regular graph
An upper bound for the harmonious chromatic number of a graph
Nearly light cycles in embedded graphs and crossing-critical graphs
On the Constructor-Blocker game
Fractional chromatic number and circular chromatic number for distance graphs with large clique size
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
Minimum K -hamiltonian graphs
George Pólya
Strong edge colorings of graphs and the covers of Kneser graphs
Two trees in maximal planar bipartite graphs
The graphs for which all strong orientations are hamiltonian
Long cycles passing through a specified edge in a 3-connected graph
Chromaticity of triangulated graphs
Regular matroids with every circuit basis fundamental
Proof of a conjecture of Alan Hartman
On connectivity in graphs with given clique number
Counting triangles in regular graphs
Strong 3-Flow Conjecture for projective planar graphs
On graph irregularity strength
Neighborhood hypergraphs of bipartite graphs
On a conjecture on maximal planar sequences
On the strong perfect graph conjecture
Fair reception and Vizing's conjecture
A note on possible extensions of Negami's conjecture
On clique-inverse graphs of graphs with bounded clique number
The fractional chromatic number of mycielski's graphs
(n, e)-Graphs with maximum sum of squares of degrees
Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree
Subgraph-avoiding coloring of graphs
Toughness and Vertex Degrees
On highly ramsey infinite graphs
Separation of graphs into three components by the removal of edges
Partitioning two?coloured complete multipartite graphs into monochromatic paths and cycles
Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
Pentagons and cycle coverings
(Theta, triangle)-free and (even hole, K 4 )-free graphs - Part 1: Layered wheels
Small odd cycles in 4-chromatic graphs
On a problem of a. kotzig concerning factorizations of 4-regular graphs
The Cartesian product of hypergraphs
Hamiltonian cycles in 3-tough 2K 2-free graphs
All ( k ; g )-cages are k -edge-connected
Classification of Regular Embeddings of Complete Multipartite Graphs
Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs
Partial Degree Conditions and Cycle Coverings
Maximum diameter of regular digraphs
Rank-tolerance graph classes
On hamiltonian line graphs of hypergraphs
On 3-colorable non-4-choosable planar graphs
A note on coverings of plane graphs
Oriented hamilton cycles in digraphs
Complexity of clique-coloring odd-hole-free graphs
Open problems of Paul Erdös in graph theory
Saturated graphs with minimal number of edges
On maximum bipartite subgraphs
Box-threshold graphs
Edge-disjoint cycles in regular directed graphs
On the chromatic number of a random 5-regular graph
On the decomposition of n -cubes into isomorphic trees
Circular perfect graphs
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs
A simple formula for the number of spanning trees of line graphs
On the second largest eigenvalue of line graphs
Large monochromatic components of small diameter
A note on path and cycle decompositions of graphs
Definitions of criticality with respect to edge-coloring
Eigenvalues and cycles of consecutive lengths
Factorizations and characterizations of induced-hereditary and compositive properties
Crossing Numbers of Periodic Graphs
Isomorphic factorization of the complete graph into Cayley digraphs
Recognizing Trees From Incomplete Decks
The last excluded case of Dirac's map-color theorem for choosability
Menger's theorem for infinite graphs with ends
The 2-hamiltonian cubes of graphs
On critically connected digraphs
Nonseparating cycles in K -Connected graphs
Circular-arc digraphs: A characterization
The graph isomorphism disease
Edge list multicoloring trees: An extension of Hall's theorem
Edge proximity and matching extension in projective planar graphs
Vector representation of graph domination
A Steiner triple system which colors all cubic graphs
Minor-order obstructions for the graphs of vertex cover 6
Biembedding a Steiner Triple System With a Hamilton Cycle Decomposition of a Complete Graph
On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs
Biclique graphs and biclique matrices
The equivalence of two conjectures of Berge and Fulkerson
Packing of three copies of a graph
Regular graphs having the same path layer matrix
Hamilton cycles and closed trails in iterated line graphs
Disjoint cycles in tournaments and bipartite tournaments
Fractal graphs
Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles
All cycle-complete graph Ramsey numbers r ( C m , K 6 )
Set intersection representations for almost all graphs
On Hamiltonian-connected regular graphs
Sharp threshold for embedding balanced spanning trees in random geometric graphs
Connectivity preserving trees in k -connected or k -edge-connected graphs
A characterization of Seymour graphs
A short proof for the Faudree-Schelp theorem on path-connected graphs
Class-reconstruction of total graphs
ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2-(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$
Minimum-degree conditions for rainbow triangles
Tree-Chromatic Number Is Not Equal to Path-Chromatic Number *
Decompositions of a complete multidigraph into nonhamiltonian paths
Locally 3-Transitive Graphs of Girth 4
Graphs with least number of colorings
A note on cliques and independent sets
Curvature on graphs via equilibrium measures
On hitting all maximum cliques with an independent set
On greene's theorem for digraphs
Extremal problems involving neighborhood unions
Ks, t Minors in (s+t)- Chromatic Graphs, II
Indecomposable r -graphs and some other counterexamples
Claw-free graphs are edge reconstructible
Finding a monochromatic subgraph or a rainbow path
Some nordhaus- gaddum-type results
Class of graphs with restricted neighborhoods
The Empire Problem in Even Embeddings on Closed Surfaces
Order plus size of 𝜏-critical graphs
On Switching to H -Free Graphs
A note on K i -perfect graphs
Quasi-transitive digraphs
Convex labelings of trees
Dividing a graph by degrees
Retracts of hypercubes
Induced Decompositions of Highly Dense Graphs
Regular factors of regular graphs
An induced subgraph characterization of domination perfect graphs
Strong chromatic index of unit distance graphs
Solution of fink & straight conjecture on path-perfect complete bipartite graphs
The Erdös-Sós Conjecture for trees of diameter four
Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set
Alternating cycles in edge-colored graphs
On the effect of major vertices on the number of light edges
On minimum degree in Hamiltonian path graphs
Strong clique trees, neighborhood trees, and strongly chordal graphs
On the number of vertices of given degree in a random graph
Realizing finite edge-transitive orientable maps
Enumerating the orientable 2-cell imbeddings of complete bipartite graphs
Two sufficient conditions for a 2-factor in a bipartite graph
Every 3-connected, locally connected, claw-free graph is Hamilton-connected
Local extrema in genus-stratified graphs
Cops and Robbers on Planar-Directed Graphs
Group connectivity: Z4 vs Z22
On the cycle-isomorphism of graphs
Paley graphs satisfy all first-order adjacency axioms
The nonorientable genus is additive
Cubic graphs without cut-vertices having the same path layer matrix
A Planar linear arboricity conjecture
Paul Turán, 1910-1976: His work in graph theory
A generalization of a Ramsey-type theorem on hypermatchings
On superperfect noncomparability graphs
A note on conservative graphs
How local irregularity gets global in a graph
Reflections on graph theory
Circular chromatic number and Mycielski construction
The prism-free planar graphs and their cycles bases
Degree Conditions for Spanning Brooms
1-Factorizations of cartesian products of regular graphs
Perfect path double covers in every simple graph
Existence of openly disjoint circuits through a vertex
On the Facial Thue Choice Index via Entropy Compression
A Ramsey-type result for the hypercube
Cycle-minors and subdivisions of wheels
Factors in a class of regular digraphs
On the number of maximal bipartite subgraphs of a graph
Short cycle covers of cubic graphs
Rotation numbers for unions of circuits
Tight asymptotics of clique-chromatic numbers of dense random graphs
Regular graphs with prescribed chromatic number
List multicoloring problems involving the k -fold Hall numbers
Self-dual embeddings of complete multipartite graphs
Spanning arborescences, ingraphs, and outgraphs
Graph decomposition with applications to subdivisions and path systems modulo k