yusuke1997/dblp-id-title huggingface dataset:
Packing two copies of a sparse graph into a graph with restrained maximum degree
From regular boundary graphs to antipodal distance-regular graphs
Bad news for chordal partitions
Distinguishing threshold of graphs
Two graphs without planar covers
A note on regular Ramsey graphs
Making an H $H$ -free graph k $k$ -colorable
Extremal graphs of diameter at most 6 after deleting any vertex
On the parity of planar covers
Locally homogeneous graphs from groups
Unique Colorability and Clique Minors
Cycles and paths in graphs with large minimal degree
Locally 4-by-4 grid graphs
Extremal digraphs on Woodall-type condition for Hamiltonian cycles in balanced bipartite digraphs
One-legged caterpillars span hypercubes
Fast generation of regular graphs and construction of cages
The connected partition lattice of a graph and the reconstruction conjecture
Harmonious labelings of windmill graphs and related graphs
Circular coloring and fractional coloring in planar graphs
Nowhere-zero flows in tensor product of graphs
The crossing number of c 4 × c 4
A survey on the study of real zeros of flow polynomials
Longest paths and cycles in bipartite oriented graphs
Multithreshold graphs
Average distance and vertex-connectivity
How many disjoint 2-edge paths must a cubic graph have?
Counting labelled 3-connected graphs
Minimal embeddings in the projective plane
Every subcubic multigraph is (1,27) $(1,{2}^{7})$-packing edge-colorable
Forbidden pairs of disconnected graphs for 2-factor of connected graphs
A counterexample to the bold conjecture
Petersen Cores and the Oddness of Cubic Graphs
Complementary cycles of any length in regular bipartite tournaments
Connected ( g, f )-factors
Degree sequences of graphs and dominance order
An excluded minor theorem for the Octahedron plus an edge
Combinatorial interpretations for T G (1, -1)
Ramsey numbers for graphs with five vertices
Gallai's path decomposition conjecture for graphs with treewidth at most 3
Erratum to: Factorizations and characterizations of induced-hereditary and compositive properties
On arc-traceable tournaments
Packing two forests into a bipartite graph
A local structure theorem on 5-connected graphs
On the number of hamilton cycles in a random graph
Boundary Properties of Factorial Classes of Graphs
A greedy algorithm for finding a large 2-matching on a random cubic graph
Quasi-median graphs and algebras
Variations on cops and robbers
Extremal Problems for a Matching and Any Other Graph
Classification of Vertex-Transitive Cubic Partial Cubes
Uniquely Cycle-Saturated Graphs
On the construction and enumeration of minimal blocks
Enumeration of connected graph coverings
Coloring with three-colored subgraphs
Defective coloring revisited
K -linked graphs with girth condition
Quasi-Random Oriented Graphs
On minors of graphs with at least 3 n -4 edges
Orientation-based edge-colorings and linear arboricity of multigraphs
Brooks' theorem with forbidden colors
Tutte polynomials for trees
Spanning trails
Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs
Vertex-transitive graphs and vertex-transitive maps
Ramsey numbers of trails and circuits
Remarks on the second neighborhood problem
On Sheehan's Conjecture for Graphs with Symmetry
About the number of oriented Hamiltonian paths and cycles in tournaments
On a conjecture about edge irregular total labelings
The chromaticity of complete bipartite graphs with at most one edge deleted
Cutting a tree with subgraph complementation is hard, except for some small trees
On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs
Polynomial bounds for chromatic number II: Excluding a star-forest
Connected cubic graphs with the maximum number of perfect matchings
Transversals in Trees
Vertex-disjoint cycles containing prescribed vertices
Linearly χ-bounding (P6, C4)-free graphs
Edge Proximity Conditions for Extendability in Planar Triangulations
k-quasi-transitive digraphs of large diameter
Extending an edge-coloring
On low bound of degree sequences of spanning trees in K -edge-connected graphs
Regular Turán numbers and some Gan-Loh-Sudakov-type problems
Radius two trees specify χ-bounded classes
Fractional chromatic number of a random subgraph
On hamiltonian cycles in the prism over the odd graphs
Isomorphic Cayley graphs on nonisomorphic groups
Y -rotation in k -minimal quadrangulations on the projective plane
Vertex degrees and doubly stochastic graph matrices
On the crossing numbers of Cartesian products with trees
A bibliography of graph equations
Completing orientations of partially oriented graphs
Tolerance graphs, and orders
Bounding chi in terms of omega and delta for quasi-line graphs
List coloring triangle-free planar graphs
Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement
The Reverse H -free Process for Strictly 2-Balanced Graphs
Highly edge-connected regular graphs without large factorizable subgraphs
Packing of graphic n -tuples
Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs
Hamiltonian properties of domination-critical graphs
Acyclic systems of representatives and acyclic colorings of digraphs
Contractors and connectors of graph algebras
Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
Topological subgraphs of cubic graphs and a theorem of dirac
The smallest degree sum that yields potentially P k -graphical sequences
Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths
Factors and factorizations of graphs - a survey
Girth in digraphs
Coloring count cones of planar graphs
On the linear vertex-arboricity of a planar graph
Matching extension in the powers of n -connected graphs
Circulants and their connectivities
Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
The extremal average distance of cubic graphs
Even-hole-free graphs part I: Decomposition theorem
Unavoidable chromatic patterns in 2-colorings of the complete graph
Upper bounds for harmonious colorings
Graphs with prescribed connectivity and line graph connectivity
Complete characterization of almost Moore digraphs of degree three
Reconstruction from the deck of -vertex induced subgraphs
Disjoint circuits in the cartesian product of two directed cycles
Minimally ( k, k )-edge-connected graphs
Note on the existence of directed ( k + 1)-cycles in diconnected complete k -partite digraphs
The 1-2-3-conjecture holds for dense graphs
On k-Edge-Hamilton-Connected Line Graphs
Detour-saturated graphs
Subtrees of graphs
A note on vertex pancyclic oriented graphs
Three local actions in 6-valent arc-transitive graphs
Coloring graphs with no induced five-vertex path or gem
Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable
Disconnected Colors in Generalized Gallai-Colorings
Maximizing H -Colorings of Connected Graphs with Fixed Minimum Degree
Hamiltonian cycles in planar triangulations with no separating triangles
Brace generation
Out-colourings of digraphs
Decomposition of complete uniform multi-hypergraphs into Berge paths and cycles
Eigenvalues and [ a , b ] -factors in regular graphs
Maximum k -colorable subgraphs
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$-choosable
On the number of edges of separated multigraphs
Tree embeddings and tree-star Ramsey numbers
A classification of graph capacity functions
Star coloring of sparse graphs
A class of symmetric graphs with 2-arc transitive quotients
Orientations of graphs with uncountable chromatic number
A decomposition for strongly perfect graphs
Monochromatic cycle partitions of edge-colored graphs
Large Subgraphs in Rainbow-Triangle Free Colorings
Long cycles passing through a specified path in a graph
Large homeomorphically irreducible trees in path-free graphs
Well-quasi-ordering and finite distinguishing number
Infinite families of 4-chromatic Grötzsch-Sachs graphs
Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs
Generalizations of a Ramsey-theoretic result of chvátal
Balanced graphs with edge density constraints
A second trivalent graph with 58 vertices and girth 9
Almost every graph has reconstruction number three
A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems
Enhancing the Erdős-Lovász Tihany Conjecture for line graphs of multigraphs
Proof of a conjecture on game domination
The Inducibility of Graphs on Four Vertices
Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9
P 3 -isomorphisms for graphs
Scaled Gromov hyperbolic graphs
On some subclasses of well-covered graphs
Upper Bounds for Erdös-Hajnal Coefficients of Tournaments
Ramsey graphs cannot be defined by real polynomials
Counting hypergraphs with large girth
On the Ubiquity of Oriented Double Rays
Longest cycles in 3-connected hypergraphs and bipartite graphs
Constructing certain families of 3-polytopal graphs
Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable
Bipartite labelings of trees and the gracesize
On the Interval Number of a Triangulated Graph
Upper bounds on the sum of powers of the degrees of a simple planar graph
The Cubic Vertices of Minimal Bricks
Even cycles in graphs
The number of connected sparsely edged graphs. II. Smooth graphs and blocks
Tutte's 5-flow conjecture for graphs of nonorientable genus 5
Rooted minors and locally spanning subgraphs
On the maximum number of copies of H in graphs with given size and order
On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
On the number of list-colorings
Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs
The independence number of an edge-chromatic critical graph
A theorem on paths in planar graphs
Pseudosimilar vertices in a graph
The multi-color Ramsey number of an odd cycle
Non-path spectrum sets
Asymptotics of the Chromatic Number for Quasi-Line Graphs
On the pseudoachromatic index of the complete graph
Diagonal Ramsey numbers for small graphs
On tree decompositions whose trees are minors
A Spectral Erdős-Faudree-Rousseau Theorem
On the parity of crossing numbers
Stability number and [ a, b ]-factors in graphs
The maximum number of induced C 5 's in a planar graph
An improvement of the crossing number bound
Unit and proper bitolerance digraphs
Connectivity properties of locally semicomplete digraphs
Medians of arbitrary graphs
K 2 -Hamiltonian graphs: II
Pseudo-Interval Graphs
A note on immersion intertwines of infinite graphs
Asymmetric graph coloring games
A characterization of regular partial cubes whose all convex cycles have the same lengths
On the existence of specified cycles in a tournament
Kings in multipartite hypertournaments
On a product dimension of bipartite graphs
Bounds on chromatic numbers of multiple factors of a complete graph
New upper bounds on the decomposability of planar graphs
Ramsey numbers for multiple copies of complete graphs
On the existence of generalized good and equitable edge colorings
The mod k $k$ chromatic index of graphs is O ( k ) $O(k)$
Graph dismantling problems
Note on the path-matching formula
Star coloring bipartite planar graphs
Dense bipartite digraphs
The number of connected sparsely edged graphs. IV large nonseparable graphs
Cubicity of interval graphs and the claw number
Cycles passing through k + 1 vertices in k -connected graphs
On the girth of hamiltonian weakly pancyclic graphs
An infinite series of regular edge- but not vertex-transitive graphs
Universal graphs for the topological minor relation
A sufficient condition for equality of edge-connectivity and minimum degree of a graph
The chromatic number of { ISK4ISK4 ISK 4 , diamond, bowtie}-free graphs
Some upper bounds on the total and list chromatic numbers of multigraphs
On covering an independent set in a grid with a second independent set
Distinguishing infinite graphs with bounded degrees
Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities
Extracting List Colorings from Large Independent Sets
Wheels in planar graphs and Hajós graphs
On the structure of graphs with a unique k -factor
Hypothetical complexity of the nowhere-zero 5-flow problem
Sparse color-critical graphs and hypergraphs with no short cycles
A graph and its complement with specified properties. IV. Counting self-complementary blocks
Partitions of a graph into paths with prescribed endvertices and lengths
Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal
Matchings in hypergraphs of large minimum degree
Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
Greedoids from flames
Maximal independent sets in graphs with at most r cycles
Rainbow independent sets in certain classes of graphs
Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two
Multiply balanced edge colorings of multigraphs
Overfullness of edge-critical graphs with small minimal core degree
Independent Domination Number of Planar Triangulations
Enumeration by frame group and range groups
Independent sets of maximal size in tensor powers of vertex-transitive graphs
Centers to centroids in graphs
On Compatible Normal Odd Partitions in Cubic Graphs
Acyclic graph coloring and the complexity of the star chromatic number
Cyclic degree and cyclic coloring of 3-polytopes
Small regular graphs having the same path layer matrix
Total domination in graphs with minimum degree three
Rainbow structures in a collection of graphs with degree conditions
On bisections of graphs without complete bipartite graphs
Nowhere-zero flows in low genus graphs
Regular factors in K 1, 3 -free graphs
On double and multiple interval graphs
Edge-disjoint spanning trees: A connectedness theorem
Vizing's coloring algorithm and the fan number
Highly connected monochromatic subgraphs of multicolored graphs
Arc-Disjoint Cycles and Feedback Arc Sets
A Proof of a Conjecture of Ohba
Cubic Graphs with Large Circumference Deficit
Computer reconstruction of small graphs
Rainbow subgraphs in edge-colored complete graphs: Answering two questions by Erdős and Tuza
Chromatic-index critical multigraphs of order 20
Blocks and the nonorientable genus of graphs
On the interval number of a chordal graph
Centers of maximal outerplanar graphs
Bipartite graphs with cycles of all even lengths
List Coloring with a Bounded Palette
Group connectivity of complementary graphs
On the Edit Distance from K2, t-Free Graphs
The number of connected sparsely edged graphs. III. Asymptotic results
The minimum number of triangles covering the edges of a graph
The number of self-complementary achiral necklaces
Critically cochromatic graphs
Hitting all maximum cliques with a stable set using lopsided independent transversals
Rank-width of random graphs
On spanning trees and walks of low maximum degree
On k -ary spanning trees of tournaments
Claw-Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ
Supereulerian regular matroids without small cocircuits
Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles
Cycle decompositions of pathwidth-6 graphs
On coloring digraphs with forbidden induced subgraphs
On replete graphs
On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
A new upper bound for the bipartite Ramsey problem
Full 4-colorings of 4-regular maps
Switchover phenomenon for general graphs
Counting circuit double covers
Maximally connected digraphs
Graph homomorphisms through random walks
A stability theorem for maximal C 2 k + 1 ${C}_{2k+1}$ -free graphs
On removable circuits in graphs and matroids
A Characterization of the degree sequences of 2-trees
Acyclic edge chromatic number of outerplanar graphs
Improved bounds on the cop number when forbidding a minor
Star transposition Gray codes for multiset permutations
Defective choosability of graphs with no edge-plus-independent-set minor
Circular flows of nearly Eulerian graphs and vertex-splitting
An upper bound for the total chromatic number of dense graphs
Path graphs
Automorphism group and diameter of a graph
Induced subgraphs and tree decompositions V. one neighbor in a hole
Bipartite 2-Factorizations of Complete Multipartite Graphs
The rank and size of graphs
On Path Convex Ramsey Numbers
Triangle-free graphs that are signable without even holes
Exceptional trivalent cayley graphs for dihedral groups
A semi-induced subgraph characterization of upper domination perfect graphs
Topological Minors of Cover Graphs and Dimension
The number of defective colorings of graphs on surfaces
Note on Perfect Forests in Digraphs
Tournaments and Vandermond's determinant
4-regular graphs without cut-vertices having the same path layer matrix
Independent Domination in Cubic Graphs
The chromatic Ramsey number of odd wheels
Fractional, Circular, and Defective Coloring of Series-Parallel Graphs
A generalization of Gale's lemma
Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
Recognizing connectedness from vertex-deleted subgraphs
Long cycles in critical graphs
Independent sets and 2-factors in edge-chromatic-critical graphs
On the exact decomposition threshold for even cycles
On independent domination of regular graphs
Constraints on the number of maximal independent sets in graphs
Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls
Size ramsey numbers of stars versus 4-chromatic graphs
Strong Chromatic Index of 2-Degenerate Graphs
Perfectly contractile diamond-free graphs
Rank and chromatic number of a graph
(1, k )-Coloring of Graphs with Girth at Least Five on a Surface
A note on graphs and sphere orders
The edge-transitive but not vertex-transitive cubic graph on 112 vertices
Diregular c -partite tournaments are vertex-pancyclic when c ≥ 5
On Diagonally 10-Coloring Plane Triangulations
Applications of Hajós-Type Constructions to the Hedetniemi Conjecture
Cycles through vertices of large maximum degree
Vertex signatures and edge-4-colorings of 4-regular plane graphs
Fan-type theorem for path-connectivity
Grünbaum colorings of even triangulations on surfaces
Nonsymmetric party problems
Uniquely restricted matchings in subcubic graphs without short cycles
Maximal chromatic polynomials of connected planar graphs
A forbidden pair for connected graphs to have spanning k-trees
A planar hypohamiltonian graph with 48 vertices
Partitioning complete multipartite graphs by monochromatic trees
A complete solution to the Cvetković-Rowlinson conjecture
On the chromaticity of certain subgraphs of a q-tree
Graphs omitting a bushy tree
Regular planar graphs with faces of only two types and shortness parameters
A note on Ramsey size-linear graphs
Bounds on Ramsey games via alterations
On the Iterated Biclique Operator
One-factorizations of the complete graph - A survey
Distinguishing orthogonality graphs
Wright's formulae for the number of connected sparsely edged graphs
Biregular Cages of Odd Girth
The A 4-structure of a graph
On extremal nonsolid bricks
A characterization of Hamiltonian prisms
The diameter of AT-free graphs
Minimum k -hamiltonian graphs, II
Representations of chordal graphs as subtrees of a tree
On the complexity of reconstructing H -free graphs from their Star Systems
Independent edges in bipartite graphs obtained from orientations of graphs
A note on k -shortest paths problem
Large components in r -edge-colorings of K n have diameter at most five
Triangle-free equimatchable graphs
Erratum to: "Star factorizations of graph products"
The connectivity of the dual
An Eulerian trail through Königsberg
Three-colored asymmetric bipartite Ramsey number of connected matchings and cycles
On the Number of 5-Cycles in a Tournament
The size of minimum 3-trees: Cases 3 and 4 mod 6
Eccentricities in the flip-graphs of convex polygons
Cutting a graph into two dissimilar halves
The number of connected sparsely edged graphs
Planar Legendrian Θ ${\rm{\Theta }}$ -graphs
A characterization of nonfeasible sets in matching covered graphs
( p, q )-odd digraphs
Maximally edge-connected realizations and Kundu's k $k$ -factor theorem
On a conjecture of Brualdi and Shen on block transitive tournaments
Partial Characterizations of 1-Perfectly Orientable Graphs
Random graphons and a weak Positivstellensatz for graphs
At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles
Independent Set Reconfiguration in Cographs and their Generalizations
There is no universal countable pentagon-free graph
Exact Results for Generalized Extremal Problems Forbidding an Even Cycle
Geodesic subgraphs
A counterexample to the rank-coloring conjecture
Examples and Counterexamples in Graph Theory
Distinguishing two graph-encoded manifolds of Lins
Erratum: Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal
Erratum to: "Fractional chromatic number and circular chromatic number for distance graphs with large clique size" Journal of Graph Theory 47(2) 2004, 129-146
Edge proximity conditions for extendability in regular bipartite graphs
Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k
Crossing numbers of Sierpinski-like graphs
Seymour's second-neighborhood conjecture from a different perspective
A Note on the History of the Four-Colour Conjecture
Induced subgraphs of product graphs and a generalization of Huang's theorem
Induced subgraphs of graphs with large chromatic number. XII. Distant stars
Colorings of infinite graphs without one-colored rays
On the Pre- and Post-Positional Semi-Random Graph Processes
DP color functions versus chromatic polynomials (II)
On the Probability that a Random Subgraph Contains a Circuit
Clique-cutsets beyond chordal graphs
An extremal bandwidth problem for bipartite graphs
On the Minimum Number of Spanning Trees in k -Edge-Connected Graphs
Fast generation of cubic graphs
Cycle length parities and the chromatic number
Minimum C 5 -saturated graphs
Packing Colourings in Complete Bipartite Graphs and the Inverse Problem for Correspondence Packing
Maximal Spectral Radius of Minimally k-(Edge)-Connected Graphs
Independence and hamiltonicity in 3-domination-critical graphs
Enumeration of cyclically 4-connected cubic graphs
Dominating sets inducing large components in maximal outerplanar graphs
Connected, locally 2-connected, K 1, 3 -free graphs are panconnected
Edge-chromatic critical graphs and the existence of 1-factors
Finding any given 2-factor in sparse pseudorandom graphs efficiently
Graphs whose choice number is equal to their chromatic number
Between the enhanced power graph and the commuting graph
On the altitude of specified nodes in random trees
Hamiltonian cycles in 3-connected claw-free graphs
Equitable list-coloring for graphs of maximum degree 3
All longest cycles in a 2-connected partial 3-tree share a common vertex
Fire Containment in Planar Graphs
Excluding a bipartite circle graph from line graphs
An upper bound on the size of the largest cliques in a graph
The Images of the Clique Operator and Its Square are Different
Characterization of graphs of diameter 2 containing a homeomorphically irreducible spanning tree
New upper bounds for the greatest number of proper colorings of a ( V , E )-graph
Coloring Graphs with Constraints on Connectivity
Overlap in consistent cycles
1-Factor and Cycle Covers of Cubic Graphs
A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge
The graph reconstruction number
Cycle systems of the line graph of the complete graph
On the edge-toughness of a graph. II
Applications of ordinary voltage graph theory to graph embeddability
Total relative displacement of vertex permutations of K
Cyclicity of graphs
High-girth cubic graphs are homomorphic to the Clebsch graph
A review of random graphs
Enumeration of trees by inversions
Product graph representations
Nowhere-zero 3-flows in locally connected graphs
An inequality involving the vertex arboricity and edge arboricity of a graph
Density of universal classes of series-parallel graphs