yusuke1997/dblp-id-title huggingface dataset:
The size of edge chromatic critical graphs with maximum degree 6
Total Embedding Distributions of Circular Ladders
Rotation numers for complete bipartite graphs
Note on the reconstruction of vertex colored graphs
Labelled graphs with vertices of degree at least three
An asymptotic version of a conjecture by Enomoto and Ota
On the Polarity and Monopolarity of Graphs
Orthogonal one-factorization graphs
Universal graphs with forbidden wheel minors
Domination in digraphs and their direct and Cartesian products
On the oriented chromatic index of oriented graphs
Families of locally separated Hamilton paths
Edge-colored saturated graphs
Kempe equivalent list colorings revisited
A survey on snarks and new results: Products, reducibility and a computer search
Alternating hamiltonian cycles in two colored complete bipartite graphs
On the Number of 4-Cycles in a Tournament
On the decomposition of K n into complete m -partite graphs
The edge-subgraph poset of a graph and the edge reconstruction conjecture
Equivalence of four descriptions of generalized line graphs
On induced subgraphs of the Hamming graph
Long cycles in 3-connected graphs in orientable surfaces
Hall parameters of complete and complete bipartite graphs
Chordal Graphs, Even-Hole-Free Graphs and Sparse Obstructions to Bounded Treewidth
The multiplicity of 1-factors in the square of a graph
Minimum cycle covers of graphs
Hamilton-connected {claw, net}-free graphs, I
Non-Hamiltonian Cartesian products of two even dicycles
Partitioning a Graph into Highly Connected Subgraphs
Maximal planar graphs of diameter two
Triangles in C 5 -free graphs and hypergraphs of girth six
Cubic graphs with most automorphisms
Hypotraceable digraphs
Positively curved graphs
A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic
On k -ordered graphs
On compact median graphs
A short proof for a generalization of Vizing's theorem
Degree frequencies in digraphs and tournaments
On bipartite 2-factorizations of k n - I and the Oberwolfach problem
Duality theorems for stars and combs III: Undominated combs
A note on a Brooks' type theorem for DP?coloring
Orientation distance graphs
Cyclic-order graphs and Zarankiewicz's crossing-number conjecture
A shortness exponent for r -regular r -connected graphs
Regular Hypertournaments and Arc-Pancyclicity
On the decomposition of k n into complete bipartite graphs
A note on generalized line graphs
Color critical hypergraphs with many edges
Rao's conjecture on self-complementary graphs with K -factors
Constructions of infinite graphs with Ramsey property
Characterizing planarity using theta graphs
Improper choosability of graphs and maximum average degree
Independent sets in tensor graph powers
Relating the independence number and the dissociation number
Graphs with homeomorphically irreducible spanning trees
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation
On self duality of pathwidth in polyhedral graph embeddings
Searching for an edge in a graph
Path homomorphisms, graph colorings, and boolean matrices
Every 2-choosable graph is (2 m, m )-choosable
On the hamiltonian path graph of a graph
Detecting even holes
Collapsible graphs and matchings
The eponymous F. P. Ramsey
Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
Claw-free graphs and 2-factors that separate independent vertices
On the minimum number of arcs in 4-dicritical oriented graphs
On uniqueness of a general factorization of graph properties
On the structure of (banner, odd hole)-free graphs
Minimum cycle coverings and integer flows
3-Coloring graphs embedded in surfaces
Linkage for the diamond and the path with four vertices
Edge colorings and circular flows on regular graphs
A class of upper-embeddable graphs
Odd edge-colorings of subdivisions of odd graphs
List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs
Flexible circuits in the d-dimensional rigidity matroid
An extension of Vizing's theorem
Circular-Arc Bigraphs and Its Subclasses
Asymptotic enumeration of full graphs
Flip distance and triangulations of a polyhedron
Extremal graphs without three-cycles or four-cycles
Generalized fibonacci cubes are mostly hamiltonian
On ( k , d )-colorings and fractional nowhere-zero flows
Matching Extension Missing Vertices and Edges in Triangulations of Surfaces
On ramsey numbers of forests versus nearly complete graphs
Pancyclicity and Cayley Graphs on Abelian Groups
Clique-inverse graphs of K 3 -free and K 4 -free graphs
Saturation Numbers in Tripartite Graphs
On the number of Hamiltonian cycles in triangulations
The bandwidth problem for graphs and matrices - a survey
Large bipartite graphs with given degree and diameter
Binding Number, Minimum Degree, and Cycle Structure in Graphs
New regular embeddings of n -cubes Q n
From steiner centers to steiner medians
On the vertex face total chromatic number of planar graphs
Properties of almost all graphs and complexes
Dependent edges in Mycielski graphs and 4-colorings of 4-skeletons
Rectilinear drawings of graphs
On the number of colorings of a snark minus an edge
Connectivity of cages
On the infinite Lucchesi-Younger conjecture I
Primitivity and independent sets in direct products of vertex-transitive graphs
Subdivisions of graphs with large minimum degree
The graphical complexity of direct products of permutation groups
On a theorem of Goldberg
Overfull conjecture for graphs with high minimum degree
Excluding Induced Subdivisions of the Bull and Related Graphs
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
Isomorphic factorizations VII. Regular graphs and tournaments
Weak degeneracy of graphs
The consecutive-4 digraphs are Hamiltonian
Set domination in graphs
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
Toughness, minimum degree, and spanning cubic subgraphs
Chordal 2-Connected Graphs and Spanning Trees
A note on some embedding problems for oriented graphs
The cyclic matching sequenceability of regular graphs
Two maps on one surface
Graph spanners
A degree sum condition for longest cycles in 3-connected graphs
On graphs with small Ramsey numbers
On the maximum number of cycles in a planar graph
A digest of the four color theorem
On the path partition number of 6-regular graphs
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs
Geodesics and almost geodesic cycles in random regular graphs
A Gallai-Edmonds-type structure theorem for path-matchings
When the cartesian product of directed cycles is Hamiltonian
Proper path-factors and interval edge-coloring of (3, 4)-biregular bigraphs
Edge-colored complete graphs without properly colored even cycles: A full characterization
The color space of a graph
Coloring rings
Random hypergraph coloring algorithms and the weak chromatic number
Embeddings of cartesian products of nearly bipartite graphs
Locally semicomplete digraphs that are complementary m -pancyclic
Signed colouring and list colouring of k-chromatic graphs
Vertex-switching, isomorphism, and pseudosimilarity
Coloring the edges of k m × k m
On the linear arboricity of planar graphs
List multicolorings of graphs with measurable sets
Generalized Embedding Schemes
Induced paths in 5-connected graphs
Short proofs of classical theorems
The construction of tutte's 8-cage and the conder graph
Parity equivalence in eulerian graphs
4-Connected 1-Planar Chordal Graphs Are Hamiltonian-Connected
Almost reconstructing infinite, rayless graphs
Size of the largest induced forest in subcubic graphs of girth at least four and five
A characterization of the smallest eigenvalue of a graph
Face distributions of embeddings of complete graphs
Near-automorphisms of paths
The relaxed game chromatic number of outerplanar graphs
The optimal general upper bound for the distinguishing index of infinite graphs
Compatible circuit decompositions of 4-regular graphs
Improved bounds for the chromatic index of graphs and multigraphs
On Forbidden Pairs Implying Hamilton-Connectedness
On list-coloring outerplanar graphs
Large cycles in generalized Johnson graphs
On hamiltonian line graphs
Equitable oriented coloring
Packing T -joins
Bipartite Intrinsically Knotted Graphs with 22 Edges
Isomorphic factorizations of trees
Erratum to: "The falsity of the reconstruction conjecture for tournaments"
Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result
Dominating Kt-Models
An extremal function for digraph subcontraction
A degree condition for spanning eulerian subgraphs
An upper bound on the size of a largest clique in a graph
Large Yk,b ${Y}_{k,b}$-tilings and Hamilton ℓ $\ell $-cycles in k $k$-uniform hypergraphs
The edge-connectivity of vertex-transitive hypergraphs
Characterization of maximum critically 2-connected graphs
Classification of chromatically unique graphs having quadratic σ-polynomials
Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach
Cubic graphs with 62 vertices having the same path layer matrix
Transitive partitions in realizations of tournament score sequences
An infinite family of biprimitive semisymmetric graphs
The maximum number of maximum dissociation sets in trees
Configurations containing a given linear hypergraph
Which generalized petersen graphs are cayley graphs?
Nonseparating K4-subdivisions in graphs of minimum degree at least 4
Decreasing the mean subtree order by adding k edges
The crossing number of C m × C n is as conjectured for n >= m ( m + 1)
Circular consecutive choosability of k -choosable graphs
On the Pseudolinear Crossing Number
Antisymmetric flows on planar graphs
Cycles of given color patterns
On the construction of odd cycle systems
Total domination in 2-connected graphs and in graphs with no induced 6-cycles
Hadwiger's Conjecture for the Complements of Kneser Graphs
The Average Solution of a TSP Instance in a Graph
An El-Zahár type condition ensuring path-factors
A 1-factorization of the line graphs of complete graphs
Representations of graphs and orthogonal latin square graphs
Counting spanning trees in a complete bipartite graph which contain a given spanning forest
Characterizations of second iterated line graphs
More intrinsically knotted graphs
New lower bounds for the size of edge chromatic critical graphs
On the distribution of cycle lengths in graphs
On Non-Hamiltonian Graphs for which every Vertex-Deleted Subgraph Is Traceable
Diagonal transformations in quadrangulations of surfaces
Note on vertex degrees of planar graphs
On multichromatic numbers of widely colorable graphs
Revisiting semistrong edge-coloring of graphs
Irredundant ramsey numbers for graphs
Total interval number for graphs with bounded degree
Cycles containing all vertices of maximum degree
A note on constructive methods for ramsey numbers
New Bounds on the Grundy Number of Products of Graphs
Minimum path decompositions of oriented cubic graphs
On the connectivity of graphs generated by a sum of random mappings
On the tree representation of chordal graphs
A degree condition for the existence of regular factors in K 1, n -free graphs
Turán numbers for disjoint paths
Bounds for the ramsey number of a disconnected graph versus any graph
Examples and counterexamples in graph theory
Fractional DP-colorings of sparse graphs
Short rainbow cycles for families of matchings and triangles
On longest cycles and strongly linking vertex sets
Multicolor bipartite Ramsey number of C 4 and large K n, n
Nearly uniform distribution of edges among k -subgraphs of a graph
Extremal problems for chromatic neighborhood sets
Tree embeddings
C-perfect hypergraphs
A note on the cover degeneracy of graphs
A localized approach for Turán number of long cycles
An accessibility theorem for infinite graph minors
Tripartite Ramsey numbers for paths
Degree-bounded coloring of graphs: Variations on a theme by brooks
Graphs with an extremal number of spanning trees
The size?Ramsey number of powers of paths
Perfect digraphs
Graphs with nilpotent adjacency matrices
On cubic non-Cayley vertex-transitive graphs
General properties of some families of graphs defined by systems of equations
Graphs with intrinsic s 3 convexities
Triply Existentially Complete Triangle-Free Graphs
Some results on tree decomposition of graphs
Estimates of coefficients of chromatic polynomials and numbers of cliques of ( c, n, m )-graphs
20-relative neighborhood graphs are hamiltonian
Cycle and cocycle coverings of graphs
On zero sum Ramsey numbers: Multiple copies of a graph
Equitable List Coloring of Planar Graphs With Given Maximum Degree
A survey: Recent results, conjectures, and open problems in labeling graphs
Spanning trees with many leaves in cubic graphs
Girth and fractional chromatic number of planar graphs
One sufficient condition for hamiltonian graphs
Vertex 2-isomorphism
Isomorphisms of P 3 -graphs
Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments
Edge-coloring of multigraphs: Recoloring technique
A Grid Theorem for Strong Immersions of Walls
Long paths and cycles in oriented graphs
Tight bounds on the chromatic sum of a connected graph
Induced trees in graphs of large chromatic number
A bound on the dissociation number
The structure of digraphs with excess one
Cycle lengths in graphs with large minimum degree
Linear arboricity of degenerate graphs
k -Independence and the k -residue of a graph
Triangles in 2-factorizations
Reconstructing the number of copies of a valency-labeled finite graph in an infinite graph
The average Steiner distance of a graph
An upper bound for the ramsey number r(K 5 - e)
Sufficient Conditions for a Digraph to be Supereulerian
A note on list-colorings
On the harmonious coloring of collections of graphs
Self-dual and self-petrie-dual regular maps
Roots of cube polynomials of median graphs
The ( t - 1 ) $(t-1)$ -chromatic Ramsey number for paths
Extremal Graphs With a Given Number of Perfect Matchings
Two-arc closed subsets of graphs
Threshold tolerance graphs
Partitioning Perfect Graphs into Stars
Equimatchable Regular Graphs
Hamiltonian path graphs
Supereulerian Digraphs with Large Arc-Strong Connectivity
Weinberg bounds over nonspherical graphs
An algebraic characterization of planar graphs
A short proof of a theorem of dirac's about hadwiger's conjecture
On the Number of Nonisomorphic Subtrees of a Tree
Classifying the globally rigid edge-transitive graphs and distance-regular graphs in the plane
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
Average distance in graphs with removed elements
On recognizing graphs by numbers of homomorphisms
Rainbow connectivity of randomly perturbed graphs
Generalized steinhaus graphs
Digraphs containing every possible pair of dicycles
Cycles in digraphs- a survey
A class of Hamiltonian polytopes
Finding Minors in Graphs with a Given Path Structure
Subgraphs smaller than the girth
A proof of Frankl-Kupavskii's conjecture on edge-union condition
Pentavalent semisymmetric graphs of square-free order
Positively curved cubic plane graphs are finite
Gray codes extending quadratic matchings
On the construction of the self-complementary graphs on 12 nodes
Retracts of Products of Chordal Graphs
The solution to an extremal problem on balanced extensions of graphs
Heavy cycles passing through some specified vertices in weighted graphs
Meyniel's theorem for strongly ( p, q ) - Hamiltonian digraphs
Quasi-random tournaments
3-Factor-Criticality of Vertex-Transitive Graphs
Even-hole-free graphs part II: Recognition algorithm
Brooks' Theorem and Beyond
Hamiltonicity and forbidden subgraphs in 4-connected graphs
Crossing numbers of sequences of graphs II: Planar tiles
Packing triangles in a graph and its complement
On packing 3-vertex paths in a graph
On DP-coloring of digraphs
Half-transitive graphs of valency 4 with prescribed attachment numbers
A characterization of domination perfect graphs
New Invariants for Partitioning a Graph Into 2-Connected Subgraphs
Decomposing large graphs with small graphs of high density
Interval colorings of graphs - Coordinated and unstable no-wait schedules
The mean order of sub-k-trees of k-trees
Tutte sets in graphs I: Maximal tutte sets and D-graphs
Quadrilateral embeddings of bipartite graphs
A necessary condition for generic rigidity of bar-and-joint frameworks in d-space
The smallest nontoroidal chiral maps
Finding Δ(Σ) for a Surface Σ of Characteristic -4
On the average shape of simply generated families of trees
Graph minors and linkages
Graphs with symmetric automorphism group
The connectivity of the basis graph of a branching greedoid
Trees that admit 3-to-1 maps onto the circle
Graphs with no K 9 = minor are 10-colorable
Stars and triangles
Edge coloring graphs with large minimum degree
Long cycles through prescribed vertices have the Erdős-Pósa property
Large Wk- or K3, t-Minors in 3-Connected Graphs
Light edges in 1-planar graphs
Infinite, highly connected digraphs with no two arc-disjoint spanning trees
Longest cycles in 3-connected graphs contain three contractible edges
Homomorphism-homogeneous graphs
Packing a tree with a graph of the same size
k -Kings in k -Quasitransitive Digraphs
DP-coloring Cartesian products of graphs
Jacobsthal Numbers in Generalized Petersen Graphs
Algebraic connectivity of the second power of a graph
The upper bound of the number of cycles in a 2-factor of a line graph
3-Degenerate induced subgraph of a planar graph
On convex embeddings of planar 3-connected graphs
Towards Gallai's path decomposition conjecture
List coloring with requests
Periods in missing lengths of rainbow cycles
Face-simple minimal quadrangulations of surfaces
On generalized cages
Extensions of Gallai-Ramsey results
Graph homomorphism reconfiguration and frozen H-colorings
Path factors in cubic graphs
Lower-bounds on the connectivities of a graph
Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5-cycles
Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity
Total choosability of multicircuits I
Path factors of bipartite graphs
Paths, cycles, and arc-connectivity in digraphs
An optimal χ -bound for ( P 6 , diamond)-free graphs
Ear-decompositions, minimally connected matroids and rigid graphs
A Dirac Type Condition for Properly Coloured Paths and Cycles
Rainbow spanning trees in complete graphs colored by one-factorizations
A Class of Three-Colorable Triangle-Free Graphs
Locally Symmetric Graphs of Girth 4
Bipartite anti-Ramsey numbers of cycles
On sparse subgraphs preserving connectivity properties
Dominating sets in n -cubes
Average distance in colored graphs
Overlap number of graphs
Another note on cliques and independent sets
Solution of a covering problem related to labelled tournaments
Nonabelian flows in networks
Ramsey Number of a Connected Triangle Matching
Antimagic orientations of even regular graphs
Convexity of minimal total dominating functions in graphs
A strengthening of Kikustapos;s theorem
Balanced supersaturation for some degenerate hypergraphs
Retracts of box products with odd-angulated factors
Nowhere-Zero 5-Flows On Cubic Graphs with Oddness 4
On the 3-Local Profiles of Graphs
Linear Clique-Width for Hereditary Classes of Cographs
An Eulerian exposition
Oriented diameter of graphs with given maximum degree
Decreasing the diameter of bounded degree graphs
Chromatic uniqueness and equivalence of K 4 homeomorphs
Turán number for odd-ballooning of trees
Signed analogue of line graphs and their smallest eigenvalues
Characterization of Digraphic Sequences with Strongly Connected Realizations
List Ramsey numbers
Domination versus independent domination in regular graphs
Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments
On the independence ratio of a graph
On the chromatic spectrum of acyclic decompositions of graphs
Long cycles in vertex-transitive graphs
Contractible edges in longest cycles
Small graphs with chromatic number 5: A computer search
Dominating sets with small clique covering number
Counterexamples Regarding Linked and Lean Tree-Decompositions of Infinite Graphs
A lower bound on the number of spanning trees with k end-vertices
A note on the matching numbers of triangle-free graphs
On two problems of defective choosability of graphs
A necessary and sufficient condition for connected, locally k-connected k 1, 3 -free graphs to be k-hamiltonian
Every 3-connected claw-free Z 8 -free graph is Hamiltonian
A characterization of P 4 -indifference graphs
Nordhaus-Gaddum-type Theorems for decompositions into many parts
Sharp bounds for decompositions of graphs into complete r -partite subgraphs
Graphs of bounded depth-2 rank-brittleness
Regular fourfold coverings with respect to the identity automorphism
Graphs obtained from Moufang loops and regular maps
Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = -5
Walks through every edge exactly twice II
Graphs in which some and every maximum matching is uniquely restricted
The connectivity of large digraphs and graphs
On minimal triangle-free 6-chromatic graphs
Vizing's conjecture: a survey and recent results
Mean distance for shapes
A Tighter Erdős-Pósa Function for Long Cycles
Shorter signed circuit covers of graphs
On characterizing Vizing's edge colouring bound
Acyclic 5-choosability of planar graphs without small cycles
The Average Degree of Minimally Contraction-Critically 5-Connected Graphs
Levi's Lemma, pseudolinear drawings of Kn, and empty triangles
Graph decompositions without isolated vertices III
Smallest domination number and largest independence number of graphs and forests with given degree sequence
On graphs with a given endomorphism monoid
The symmetric (2 k, k )-graphs
On independent circuits of a digraph
On a Conjecture on a Laplacian Matrix with Distinct Integral Spectrum
Well covered simplicial, chordal, and circular arc graphs
3-colorability of 4-regular hamiltonian graphs
On Choosability with Separation of Planar Graphs with Forbidden Cycles
Large induced forests in sparse graphs
Distinguishing geometric graphs
Brooks-type theorems for choosability with separation
A partition approach to Vizing's conjecture
Edge disjoint cycles through specified vertices
On one-factorizations of compositions of graphs
On the genus of the semidirect product of ℤ 9 by ℤ 3
Flexible list colorings: Maximizing the number of requests satisfied
K 4 - -factor in a graph
Completion of the mixed unit interval graphs hierarchy
Gabriel andrew dirac
On Small Separations in Cayley and Vertex Transitive Graphs
Cyclic coloration of 3-polytopes
Fold-2-covering triangular embeddings
On K s, t minors in ( s + t )-chromatic graphs
Projective-Planar Graphs with No K 3, 4-Minor
Short rainbow cycles in graphs and matroids
Sequences, claws and cyclability of graphs
The Hamiltonicity of essentially 9-connected line graphs
Editorial: Changing of the guard
Finite symmetric graphs with two-arc transitive quotients II
Internal Partitions of Regular Graphs
The Gray graph revisited
A topological lower bound for the circular chromatic number of Schrijver graphs
Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph"
Exploring an unknown graph
Critical graphs for subpancyclicity of 3-connected claw-free graphs
The ally-reconstruction number of a tree with five or more vertices is three
Signed degree sequences of signed graphs
On paths in planar graphs
2-factors in random regular graphs
On path lengths modulo three
One-way infinite 2-walks in planar graphs
A Characterization of b-Perfect Graphs
(Theta, triangle)-free and (even hole, K 4 )-free graphs. Part 2: Bounds on treewidth
Cycles Avoiding a Color in Colorful Graphs
On subpancyclic line graphs
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable
Minimal bricks with the maximum number of edges
Berge trigraphs
An infinite family of octahedral crossing numbers
Hamilton cycles in prisms
Duality theorems for stars and combs IV: Undominating stars
Super stable tensegrities and the Colin de Verdière number ν \unicode{x003BD}