yusuke1997/dblp-id-title huggingface dataset:
On homomorphisms to acyclic local tournaments
A Relaxed Version of the Erdős-Lovász Tihany Conjecture
The circular chromatic number of series-parallel graphs with large girth
Constrained Ramsey numbers for rainbow matching
Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and the H 6 -Conjecture
Retract-collapsible graphs and invariant subgraph properties
Judicious partitions of bounded-degree graphs
Distance graphs with missing multiples in the distance sets
Edge-partitions of planar graphs and their game coloring numbers
The plane-width of graphs
Improved bound on vertex degree version of Erdős matching conjecture
Decomposing Graphs of High Minimum Degree into 4-Cycles
Equitable list coloring and treewidth
On the crossing number of c m × c n
Graphs of degree 4 are 5-edge-choosable
Multiple list coloring of 3-choice critical graphs
Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles
Induced subgraphs of prescribed size
Hamilton-connected {claw,net}-free graphs, II
Updating the hamiltonian problem - A survey
A Brooks-Type Theorem for the Bichromatic Number
An improved upper bound on the crossing number of the hypercube
Dirac's map-color theorem for choosability
Hamiltonian groups are color-graph-hamiltonian
On p -intersection representations
Acyclic Edge Coloring of Triangle-Free Planar Graphs
Matching cutsets in graphs
Some unavoidable subdigraphs of tournaments
On the delta-wye reduction for planar graphs
Non-Cayley tetravalent metacirculant graphs and their Hamiltonicity
Thin edges in cubic braces
On genus imbeddings of the tensor product of graphs
Note on irreducible triangulations of surfaces
Large classes of infinite k -cop-win graphs
Uniform hypergraphs with many edge-colorings avoiding a fixed rainbow expanded complete graph
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs
New characterizations of digraphs represented by intervals
Powers of Hamiltonian cycles in randomly augmented Dirac graphs - The complete collection
Functions and line digraphs
On oriented m $m$-semiregular representations of finite groups
Four Constructions of Highly Symmetric Tetravalent Graphs
Partitioning oriented 2-paths
A new 5-arc-transitive cubic graph
Orientations of graphs avoiding given lists on out-degrees
Improper coloring of graphs on surfaces
Modularity of minor-free graphs
Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs
On the quartet distance given partial information
An extremal problem for subdivisions of K
Local Clique Covering of Claw-Free Graphs
Isoradial immersions
Find subtrees of specified weight and cycles of specified length in linear time
On the minimum size of tight hypergraphs
Long paths, long cycles, and their relative length
Two sufficient conditions for dominating cycles
Tough spiders
Randomly matchable graphs
Covering 3-uniform hypergraphs by vertex-disjoint tight paths
Complete subgraphs with large degree sums
Vertex partitions of chordal graphs
Spectral radius and edge-disjoint spanning trees
Constructing Graphs with No Immersion of Large Complete Graphs
Spanning subgraphs of graphs partitioned into two isomorphic pieces
Isometric cycles, cutsets, and crowning of bridged graphs
A decomposition method on solving the linear arboricity conjecture
On induced subgraphs of a block
Hamiltonicity for K 1, r -free graphs
A ramsey-theoretic result involving chromatic numbers
The distinguishing index of graphs with infinite minimum degree
On Endomorphism Universality of Sparse Graph Classes
Rainbow Arborescence in Random Digraphs
Brooks-Type Colourings of Digraphs in Linear Time
A property of trees in terms of unique connected subgraphs
Counting cubic graphs
A note on the characterization of domination perfect graphs
Equimatchable Graphs on Surfaces
Hamiltonian cycles in 2-connected claw-free-graphs
3-Flows and Combs
Archimedean ϕ -tolerance graphs
Vertex criticality for upper domination and irredundance
Bounded-excess flows in cubic graphs
Enumeration of acyclic and unicyclic nets with four types of self-duality
A generalization of the Oberwolfach problem
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2
Edge-face chromatic number and edge chromatic number of simple plane graphs
G-constructibility of planar graphs
Fractional colorings with large denominators
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number
Maximum number of colorings of (2 k, k 2 )-graphs
Proof of a conjecture on cycles in a bipartite graph
On the mean subtree order of trees under edge contraction
On the clique number of the square of a line graph and its relation to maximum degree of the line graph
Monochromatic Cycle Partitions in Local Edge Colorings
Graphs with No Induced Five-Vertex Path or Antipath
A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian - An Approach to Vizing's 2-Factor Conjecture
Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs
Maximum spectral radius of outerplanar 3-uniform hypergraphs
M -degrees of quadrangle-free planar graphs
Cycle Double Covers in Cubic Graphs having Special Structures
On the order of antipodal covers
Randomly antitraceable digraphs
Counting connected partitions of graphs
Asymptotic bounds for irredundant and mixed Ramsey numbers
Counting strong digraphs
On connectivities of tree graphs
Induced matching extendable graphs
Regular matroid decomposition via signed graphs
Optimal acyclic edge-coloring of cubic graphs
On the Multigraph Overfull Conjecture
Berge graphs with chordless cycles of bounded length
Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable
The Structure of Bull-Free Perfect Graphs
A characterization of ptolemaic graphs
Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes
Partition functions and a generalized coloring-flow duality for embedded graphs
Supereulerian bipartite digraphs
Perfect double covers with paths of length four
Some large graphs with given degree and diameter
Achromatic number of fragmentable graphs
Bijective proofs of two broken circuit theorems
Chromatic numbers of quadrangulations on closed surfaces
Total weight choosability of graphs
On the Minimum Degree of Minimally t-Tough, Claw-Free Graphs
Dense graphs with small clique number
Squaring a tournament: A proof of Dean's conjecture
Colorings of complements of line graphs
Extending regular edge-colorings of complete hypergraphs
On the acyclic choosability of graphs
Maximal matchings in graphs with large neighborhoods of independent vertices
Forcing highly connected subgraphs
Average distance, minimum degree, and spanning trees
New upper bounds on harmonious colorings
Spanners in randomly weighted graphs: Euclidean case
Rainbow Numbers for Cycles in Plane Triangulations
Sparse pseudo-random graphs are Hamiltonian
Equitable List Coloring of Graphs with Bounded Degree
Structural properties of graph products
Implications among linkage properties in graphs
Cutpoints and the chromatic polynomial
Graph theory as applied mathematics
Uniqueness of highly representative surface embeddings
The circular chromatic number of series-parallel graphs
On Cyclic Decompositions of Complete Graphs into Tripartite Graphs
Monochromatic Clique Decompositions of Graphs
Conformally Rigid Graphs
Note on Hamiltonicity of Basis Graphs of Even Delta-Matroids
Even Factors of Large Size
Circular colorings of weighted graphs
Weakening arcs in tournaments
Directed distance in digraphs: Centers and medians
Thoroughly dispersed colorings
Multi-coloring the Mycielskian of graphs
Polynomial bounds for chromatic number VII. Disjoint holes
An edge coloring problem for graph products
The overfull conjecture on graphs of odd order and large minimum degree
On the number of minimal separators in graphs
Spanning 2-trails from degree sum conditions
A short proof of the wonderful lemma
High powers of Hamiltonian cycles in randomly augmented graphs
A lower bound on the order of regular graphs with given girth pair
On k -Maximal Strength Digraphs
Some extremal results in cochromatic and dichromatic theory
Hamiltonian κ-factors in graphs
Vertices of degree k in random unlabeled trees
Optimal chromatic bound for ( ¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$ )-free graphs
On the independence number of graphs related to a polarity
Unitary Graphs
Edge-disjoint paths and cycles in n -edge-connected graphs
Between proper and strong edge-colorings of subcubic graphs
Packing two bipartite graphs into a complete bipartite graph
On Graphs Without Multicliqual Edges
Circular choosability
Matchings and walks in graphs
Generalizations of tournaments: A survey
Extending edge-colorings of complete hypergraphs into regular colorings
Vertex-distinguishing edge colorings of graphs
NP completeness of the edge precoloring extension problem on bipartite graphs
Disjoint directed quadrilaterals in a directed graph
Two sets of graceful graphs
Supereulerian graphs: A survey
Cycle-Continuous Mappings - Order Structure
Spanning Trees with Vertices Having Large Degrees
Constructions of bipartite graphs from finite geometries
Integer flows on triangularly connected signed graphs
Proof of a conjecture of Plummer and Zha
The determining number of a Cartesian product
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
Embedding of graphs in two-irregular graphs
The number of vertices of degree k in a minimally k -edge-connected digraph
On Tutt's Characterization of graphic matroids - a graphic proof
On the connectivity of maximal planar graphs
Flexibility of triangle-free planar graphs
Forbidden induced subgraph characterization of cograph contractions
On the Roots of Expected Independence Polynomials
Forbidden subgraphs and hamiitonian properties in the square of a connected graph
Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings
2-connected coverings of bounded degree in 3-connected graphs
A charcterization of 4-edge-connected eulerian graphs
Families in posets minimizing the number of comparable pairs
Vertex-disjoint cycles containing specified vertices in a bipartite graph
An algorithm for the decomposition of graphs into cliques
On bipartite graphs of diameter 3 and defect 2
Relative length of long paths and cycles in graphs with large degree sums
Relative length of longest paths and cycles in 3-connected graphs
Chromatic λ-choosable and λ-paintable graphs
Lines in bipartite graphs and in 2-metric spaces
Minimizer graphs for a class of extremal problems
Combinatorial curvature for planar graphs
Tight products and graph expansion
Iterating the branching operation on a directed graph
Cubic graphs with crossing number two
Path chromatic numbers of graphs
Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
Representing products of polyhedra by products of edge-colored graphs
The potential of greed for independence
Coloring ( P 5 , gem ) $({P}_{5}, \text{gem})$ -free graphs with Δ - 1 ${\rm{\Delta }}-1$ colors
Nowhere zero 4-flow in regular matroids
Tiling 3-Uniform Hypergraphs With K43-2e
On nonfeasible edge sets in matching-covered graphs
On the chromatic number of the product of graphs
Pebbling Graphs of Fixed Diameter
The complete closure of a graph
On the extremal function for graph minors
Graph reconstruction - a survey
Proof of a conjecture on fractional Ramsey numbers
Partitioning edges of a planar graph into linear forests and a matching
Another proof of Seymour's 6-flow theorem
Note on a min-max conjecture of Woodall
A Closure for 1-Hamilton-Connectedness in Claw-Free Graphs
Almost all steinhaus graphs have diameter 2
Achiral plane trees
An Extremal Property of Turán Graphs, II
t-Cores for (Δ+t) -edge-coloring
NP-completeness of list coloring and precoloring extension on the edges of planar graphs
Tetravalent vertex-transitive graphs of order 4p
Sufficient conditions for equality of connectivity and minimum degree of a graph
Lengths of cycles in halin graphs
Subdigraphs of prescribed size and out-degree
Orthogonal latin square graphs
Subdivisions, parity and well-covered graphs
Prism-hamiltonicity of triangulations
Independence, odd girth, and average degree
An improvement of fraisse's sufficient condition for hamiltonian graphs
Enumeration of weak isomorphism classes of signed graphs
More proofs of menger's theorem
On the presence of disjoint subgraphs of a specified type
The k th Laplacian eigenvalue of a tree
Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs
On minimum sets of 1-factors covering a complete multipartite graph
Off-diagonal and asymptotic results on the Ramsey number r ( K 2, m , K 2, n )
Generation of isospectral graphs
An eulerian trail traversing specified edges in given order
A better bound for the cop number of general graphs
Small cycle double covers of products I: Lexicographic product with paths and cycles
Edge-transitive homogeneous factorizations of complete uniform hypergraphs
The biparticity of a graph
Hamiltonicity and Degrees of Adjacent Vertices in Claw-Free Graphs
On the Rigidity of Sparse Random Graphs
Strong Circuit Double Cover of Some Cubic Graphs
On the Density of Transitive Tournaments
A characterization of consistent marked graphs
On partitioning interval graphs into proper interval subgraphs and related problems
Two-sided Group Digraphs and Graphs
Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
A family of graphs and the degree/diameter problem
Long properly coloured cycles in edge-coloured graphs
Exotic n -universal graphs
The number of tournaments with a unique spanning cycle
The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs
Frequently cited publications in pure graph theory
Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups
Intrinsically knotted graphs
The structure of saturated critical blocks
Minimum codegree condition for perfect matchings in k-partite k-graphs
Generation of Cubic Graphs and Snarks with Large Girth
Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
Linearly free graphs
Realization of digraphs in Abelian groups and its consequences
List-coloring the square of a subcubic graph
Strongly Even-Cycle Decomposable Graphs
Bounds for the harmonious chromatic number of a graph
K 6 -minors in triangulations and complete quadrangulations
Partite Saturation Problems
On vertex critical graphs with prescribed diameter
Bipartite graphs and their endomorphism monoids
Isomorphic decomposition of complete graphs into linear forests
Extensions of a theorem of Erdős on nonhamiltonian graphs
Achromatic and Harmonious Colorings of Circulant Graphs
Planar graph colorings without short monochromatic cycles
The list linear arboricity of graphs
On total 9-coloring planar graphs of maximum degree seven
Disjoint total dominating sets in near-triangulations
Hamilton decompositions of cartesian products of multicycles
On a conjecture of Thomassen concerning subgraphs of large girth
Complete graphs with no rainbow tree
Graph curvature and local discrepancy
Leaf-Critical and Leaf-Stable Graphs
Balanced judicious bipartitions of graphs
Iterated line graphs are maximally ordered
Digraph analogues for the Nine Dragon Tree Conjecture
An Ore-type condition for large k -factor and disjoint perfect matchings
An application of the combinatorial Nullstellensatz to a graph labelling problem
Edge-Connectivity Between Edge-Ends of Infinite Graphs
Fragile graphs with small independent cuts
Intersections of longest cycles in grid graphs
Perfect Elimination and Chordal Bipartite Graphs
A sufficient condition for a regular graph to be class 1
Covering 2-colored complete digraphs by monochromatic d $d$ -dominating digraphs
The maximum interval number of graphs with given genus
Extreme degrees in random graphs
Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]-decorated containers
Maximal K 3's and Hamiltonicity of 4-connected claw-free graphs
Vertex-distinguishing proper edge-colorings
Hamiltonian decompositions of strong products
Planar graphs without 4-cycles are acyclically 6-choosable
Hamiltonicity of planar graphs with a forbidden minor
Disjoint Hamilton cycles in the random geometric graph
On triangles in -minor free graphs
On the Ramsey multiplicities of graphs - problems and recent results
Supereulerian complementary graphs
Hamiltonicity of 5-Connected Toroidal Triangulations
Spectral criterion for cycle balance in networks
Multicolor Turán numbers II: A generalization of the Ruzsa-Szemerédi theorem and new results on cliques and odd cycles
Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
Graphs with no induced house nor induced hole have the de Bruijn-Erdös property
Uncountable dichromatic number without short directed cycles
Connectedness and Isomorphism Properties of the Zig-Zag Product of Graphs
The edge reconstruction number of a disconnected graph
Unit subduced cycle indices for combinatorial enumeration
Homage to the memory of Kazimierz Kuratowski
Contractible elements in k -connected graphs not containing some specified graphs
On the number of cycles of length k in a maximal planar graph
Graphs without isometric rays and invariant subgraph properties, I
Tight bounds for the vertices of degree k in minimally k-connected graphs
Bisimplicial separators
There exist graphs with super-exponential Ramsey multiplicity constant
A bibliographic survey of edge-colorings
Size and independence in triangle-free graphs with maximum degree three
Hadwiger's Conjecture for ℓ-Link Graphs
Edge-disjoint Hamiltonian cycles in hypertournaments
Mixed ramsey numbers: Chromatic numbers versus graphs
On the berge - sauer conjecture
On the structure of consistent cycles in cubic symmetric graphs
Partitioning a graph into two isomorphic pieces
Ramsey problems and their connection to tuŕan-type extremal problems
On finite groups with the cayley isomorphism property
Some probabilistic restatements of the Four Color Conjecture
n -cubes and median graphs
The structure of 4-strong tournaments containing exactly three out-arc pancyclic vertices
Generating 5-regular planar graphs
On the existence of countable universal graphs
Some conditions for the existence of f -factors
An Extension of Cui-Kano's Characterization on Graph Factors
A general upper bound for the cyclic chromatic number of 3-connected plane graphs
Planar Digraphs of Digirth Five Are 2-Colorable
Finite 2-Geodesic Transitive Graphs of Prime Valency
A note on the maximum number of triangles in a C5-free graph
Computing the orientable genus of projective graphs
Extremal bipartite subgraphs of cubic triangle-free graphs
Chung-Yau Invariants and Graphs with Symmetric Hitting Times
Monochromatic K r -Decompositions of Graphs
Disjoint cycles covering matchings in graphs with partial degrees
On an anti-Ramsey threshold for sparse graphs with one triangle
A lower bound for groupies in graphs
Homomorphism bounds for oriented planar graphs
New bounds for the chromatic number of graphs
The existence of k -to-1 continuous maps between graphs when k is sufficiently large
Contractible subgraphs in k -connected graphs
Toppling kings in a tournament by introducing new kings
Highly Connected Infinite Digraphs Without Edge-Disjoint Back and Forth Paths Between a Certain Vertex Pair
A result on extendibility in the powers of graphs
Anti-Ramsey numbers of doubly edge-critical graphs
The rediscovery of Redfield's papers
Excluded Minors and the Ribbon Graphs of Knots
Equistable graphs
Insertible vertices, neighborhood intersections, and hamiltonicity
Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles
Stability of Rose Window graphs
A class of geodetic blocks
Planar graphs producing no strongly almost trivial embedding
Extremal functions for rooted minors
On the number of cycles of length 4 in a maximal planar graph
Spanning k -arc-strong subdigraphs with few arcs in k -arc-strong tournaments
Partial characterizations of circular-arc graphs
A class of planar well-covered graphs with girth four
On Cayley digraphs on nonisomorphic 2-groups
Infinite families of biembedding numbers
The structure of graphs with no W 4 immersion
Edge clique covers in graphs with independence number two
Forbidden induced bipartite graphs
Remarks on the placeability of isomorphic trees in a complete graph
Clique minors in double-critical graphs
Cycles containing matchings and pairwise compatible euler tours
The genus of the n -octahedron: Regular cases
Large k -preserving sets in infinite graphs
The connectivity of minimal imperfect graphs
On minimum bisection and related cut problems in trees and tree-like graphs
A simple proof of Menger's theorem
The chromatic number of oriented graphs
Antimagic labelling of vertex weighted graphs
Large P 4 -free graphs with bounded degree
Diameter of random spanning trees in a given graph
Positive Co-Degree Turán Number for C 5 and C 5 -
Independence and graph homomorphisms graph homomorphisms
The greedy clique decomposition of a graph
Straight line embeddings of cubic planar graphs with integer edge lengths
On the Pósa-Seymour conjecture
A more accurate view of the Flat Wall Theorem
Multiplicativity. Part I. Variations, multiplicative graphs, and digraphs
Bipartite spanning sub(di)graphs induced by 2-partitions
Integral trees of odd diameters
The minimum degree of Ramsey-minimal graphs
A good characterization of cograph contractions
Tree-complete graph ramsey numbers
Minimal extensions of graphs to absolute retracts
Recursive generation of partitionable graphs
On the orientable genus of graphs embedded in the klein bottle
The circular chromatic number of the Mycielskian of G
Recursive constructions for triangulations
On cycle - Complete graph ramsey numbers
On Meyniel's conjecture of the cop number
Redfield's lost paper in a modern context
Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments
Smallest regular graphs with prescribed odd girth
A new planarity criterion for 3-connected graphs
Exact bipartite Turán numbers of large even cycles
Reconstructing trees from two cards
On a Quasi-Ramsey problem
An induced subgraph of the Hamming graph with maximum degree 1
Short odd cycles in 4-chromatic graphs
Oriented walk double covering and bidirectional double tracing
Semistrong edge coloring of graphs
Subdivided graphs have linear ramsey numbers
On graphs satisfying a local ore-type condition
Characterizing Graphs with Crossing Number at Least 2
Chromatic numbers of hypergraphs and coverings of graphs
On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
A Proof to Bang-Jensen, Havet and Yeo's Conjecture on the Hamiltonian Cycles Avoiding Prescribed Arcs in Semicomplete Digraphs
The product structure of squaregraphs
On graphs for which large books are Ramsey good
The book crossing number of a graph
On density of subgraphs of Cartesian products
Hitting Times, Cover Cost, and the Wiener Index of a Tree
Divisible subdivisions
Almost all trees share a complete set of immanantal polynomials
Partitioning a graph into cycles with a specified number of chords
Cycle-factors in oriented graphs
Note on the reconstruction of infinite graphs with a fixed finite number of components
Posets and planar graphs
A newly recognized intrinsically knotted graph
Packing k -edge trees in graphs of restricted vertex degrees
The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree
Adaptable and conflict colouring multigraphs with no cycles of length three or four
Local edge colorings that are global
Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions
A note on the work and life of Kazimierz Kuratowski
Small Planar Hypohamiltonian Graphs
A note on complete subdivisions in digraphs of large outdegree
Vertex-transitive graphs: Symmetric graphs of prime valency
Ramsey numbers upon vertex deletion
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
Homage to george pólya