yusuke1997/dblp-id-title huggingface dataset:
Sufficient conditions for spanning trees with constrained leaf distance in a graph
Per-spectral characterizations of some bipartite graphs
Extremal matching energy of complements of trees
A note on the Ramsey number of even wheels versus stars
On hereditary properties of composition graphs
Heavy subgraph pairs for traceability of block-chains
On list equitable total colorings of the generalized theta graph
A note on periodicity of the 2-distance operator
Signed Roman edge k -domination in graphs
Tetravalent arc-transitive graphs of order 3p 2
Characterizing Cartesian fixers and multipliers
Futher results on radial graphs
Supermagic generalized double graphs
Path and cycle factors of cubic bipartite graphs
A Fan-type heavy pair od subgraphs for pancyclicity of 2-connected graphs
Conflict-free vertex-connections of graphs
L (2, 1)-labeling of circulant graphs
An O(mn 2 ) algorithm for computing the strong geodetic number in outerplanar graphs
On a graph labelling conjecture involving coloured labels
The neighbor-locating-chromatic number of trees and unicyclic graphs
Colouring game and generalized colouring game on graphs with cut-vertices
Some recent results on domination in graphs
Clique graph representations of ptolemaic graphs
Structural results on maximal k -degenerate graphs
Edge cycle extendable graphs
Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
The path-pairability number of products of stars
Interval edge-colorings of Cartesian products of graphs I
ℓ-covering k-hypergraphs are quasi-eulerian
WORM colorings
Tight description of faces in toroidal graphs with minimum degree at least 4
On critical and cocritical radius edge-invariant graphs
A path(ological) partition problem
Radio number for some thorn graphs
Unique-maximum coloring of plane graphs
On the p-domination number of cactus graphs
Generalized matrix graphs and completely independent critical cliques in any dimension
Rainbow disjoint union of clique and matching in edge-colored complete graph
Scaffold for the polyhedral embedding of cubic graphs
A note on face coloring entire weightings of plane graphs
Graph centers used for stabilization of matrix factorizations
On traceability and 2-factors in claw-free graphs
KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition
Paired domination in prisms of graphs
Sums of powered characteristic roots count distance-independent circular sets
The strong isometric dimension of finite reflexive graphs
Spectral study of alliances in graphs
k -independence stable graphs upon edge removal
Constant sum partition of sets of integers and distance magic graphs
The edge C 4 graph of some graph classes
Competition hypergraphs of digraphs with certain properties I. Strong connectedness
The total { k }-domatic number of digraphs
The triangle-free graphs that are competition graphs of multipartite tournaments
The matching extendability of optimal 1 -embedded graphs on the projective plane
Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity
A note on the locating-total domination in graphs
More results on the smallest one-realization of a given set II
Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices
On choosability of complete multipartite graphs K 4, 3*t, 2*(k-2t-2), 1*(t+1)
The Laplacian spectrum of some digraphs obtained from the wheel
Decomposition of complete graphs into forests with six edges
Recognizable colorings of cycles and trees
The sizes of components in random circle graphs
Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs
Placing bipartite graphs of small size II
Minimal rankings of the Cartesian product K n \Box K m
On the metric dimensions for sets of vertices
The well-covered dimension of products of graphs
The crossing numbers of products of path with graphs of order six
Zero and total forcing dense graphs
On the structure of paths-like trees
Graph classes generated by Mycielskians
Ascending subgraph decompositions of oriented graphs that factor into triangles
On doubly light vertices in plane graphs
Strong chromatic index of planar graphs with large girth
More on even [a, b] -factors in graphs
Total forcing sets and zero forcing sets in trees
Split Euler tours in 4-regular planar graphs
On vertices enforcing a Hamiltonian cycle
Conflict -free connections of graphs
Total Roman 2-dominating functions in graphs
Matchings and total domination subdivision number in graphs with few induced 4-cycles
The domination number of K n 3
Approximate and exact results for the harmonious chromatic number
The achromatic number of the Cartesian product of K 6 and K q
Factoring directed graphs with respect to the cardinal product in polynomial time II
Decompositions of multigraphs into parts with two edges
A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs
A magical approach to some labeling conjectures
Edge-disjoint paths in permutation graphs
On maximum weight of a bipartite graph of given order and size
Metric dimension and diameter in bipartite graphs
Computing the metric dimension of a graph from primary subgraphs
The bipartite-splittance of a bipartite graph
Almost self-complementary 3-uniform hypergraphs
Toughness, forbidden subgraphs, and Hamiltonian-connected graphs
The signed total Roman k -domatic number of a graph
Full domination in graphs
Global dominator coloring of graphs
Clique parts independent of remainders
4-transitive digraphs I: the structure of strong 4-transitive digraphs
The chromatic number of random intersection graphs
Difference labelling of digraphs
Rotation and jump distances between graphs
A characterization of Roman trees
Distance independence in graphs
Strongly pancyclic and dual-pancyclic graphs
On the rank of random subsets of finite affine geometry
The number of disjoint pairs in families of k -element subsets
The cobondage number of a graph
Decompositions into two paths
A note on a broken-cycle theorem for hypergraphs
C 7 -decompositions of the tensor product of complete graphs
A survey of the Path Partition Conjecture
A note on uniquely embeddable forests
Generalized Ramsey theory and decomposable properties of graphs
Representing split graphs by words
Completely independent spanning trees in (partial) k -trees
Some sharp bounds on the negative decision number of graphs
A decomposition of Gallai multigraphs
Trees with restrained domination and total restrained domination numbers
On (p, 1) -total labelling of some 1-planar graphs
On the beta-number of forests with isomorphic components
Lower boundary independent broadcasts in trees
Vertex-edge domination in interval and bipartite permutation graphs
On the stability for pancyclicity
The star dichromatic number
A classification of cactus graphs according to their domination number
Kernels by monochromatic paths and color-perfect digraphs
The probabilistic upper bounds on the isolation number of a graph
Dissociation in circulant graphs and integer distance graphs
Chromatic properties of the Pancake graphs
On the heterochromatic number of circulant digraphs
The bondage number of graphs: good and bad vertices
Universality in graph properties with degree restrictions
Domination game: extremal families for 3/5-conjecture for forests
On maximal finite antichains in the homomorphism order of directed graphs
Distance Coloring of the Hexagonal Lattice
Minimal forbidden subgraphs of reducible graph properties
The minimum harmonic index for unicyclic graphs with given diameter
(H, k) stable graphs with minimum size
Trees with unique least central subtrees
On domination of Cartesian product of directed cycles: Results for certain equivalence
The complexity od secure domination problem in graphs
Erdös-Ko-Rado from intersecting shadows
On singular signed graphs with nullspace spanned by a full vector: signed nut graphs
On the Ramsey numbers of non-star trees versus connected graphs of order six
Factoring directed graphs with respect to the cardinal product in polynomial time
On the broadcast independence number of locally uniform 2-lobsters
A note on vertex colorings of plane graphs
Bounds on the signed 2-independence number in graphs
Graphs without induced P 5 and C 5
Large contractible subgraphs of a 3-connected graph
Sharp upper bounds on the Clar number of fullerene graphs
Total 2-rainbow domination numbers in trees
Domination game critical graphs
A charaterization of planar median graphs
Double Roman and double Italian domination
M 2 -edge colorings of cacti and graph joins
Trees with distinguishing index equal distinguishing number plus one
Minimal trees and monophonic convexity
Edge-connectivity and edges of even factors of graphs
Light edges in 1-planar graphs with prescribed minimum degree
Sum labellings of cycle hypergraphs
Decomposition of complete bipartite digraphs and even complete multigraphs into closed trails
On a characterization of graphs by average labellings
Hamiltonian properties in generalized lexicographic products
Deficiency and forbidden subgraphs of connected, locally-connected graphs
Arbitrarily partitionable 2K 2 , C 4 -free graphs
A characterization of locating-total domination edge critical graphs
A note on the total detection numbers of cycles
Graphic splitting of cographic matroids
Non-path results on the connectivity keeping problem
Optimal locating-total dominating sets in strips of height 3
An efficient polynomial time approximation scheme for the vertex cover P 3 problem on planar graphs
Spanning trees whose stems have a bounded number of branch vertices
A note on the uniqueness of stable marriage matching
On the tree graph of a connected graph
The sum number of d-partite complete hypergraphs
High-ordered spectral characterization of unicyclic graphs
$(k,H)$-kernels in nearly tournaments
Graph colorings with local constraints - a survey
Some properties of the eigenvalues of the net Laplacian matrix of a signed graph
Weak total resolvability in graphs
The existence of quasi regular and bi-regular self-complementary 3-uniform hypergraphs
Block graphs with large paired domination multisubdivision number
Precise upper bound for the strong edge chromatic number of sparse planar graphs
Characterizations of planar plick graphs
A characterization of hypergraphs with large domination number
Graphs with double domination numbers
The k -rainbow domatic number of a graph
Algorithmic aspects of total k-subdomination in graphs
Gallai-Ramsey numbers for rainbow S + 3 and monochromatic paths
Minimal vertex degree sum of a 3-path in plane maps
Circuit bases of strongly connected digraphs
The semitotal domination problem in block graphs
Perturbations in a signed graph and its index
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
Fault tolerant detectors for distinquishing sets in graphs
Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4
Decompositions of plane graphs under parity constrains given by faces
Decomposition tree and indecomposable coverings
(H, k) stable bipartite graphs with the minimum size
Downhill domination in graphs
Mycielskians and matchings
A Ramsey-type theorem for multiple disjoint copies of induced subgraphs
A note on neighbor expanded sum distinguishing index
Bounding neighbor-connectivity of Abelian Cayley graphs
On the total graph of Mycielski graphs, central graphs and their covering numbers
Some applications of pq-groups in graph theory
The Ramsey number r(C 7 , C 7 , C 7 )
An analogue of quasi-transitivity for edge-coloured graphs
A note on PM -compact bipartite graphs
Decomposing complete graphs into cubes
Corrigendum to "Minimum edge cuts in diameter 2 graphs"
On the structure of strong k -transitive digraphs
Pancyclism and small cycles in graphs
Oriented colouring of some graph products
Hajós' theorem for list colorings of hypergraphs
On Grundy total domination number in product graphs
Twins in ordered hyper-matchings
Equitable colorings of corona multiproducts of graphs
Niche hypergraphs
A constructive characterization of vertex cover Roman trees
Families of triples with high minimum degree are Hamiltonian
Partitions of some planar graphs into two linear forests
The Hanoi graph H 3 4
Set-sequential labelings of odd trees
A note on k -uniform self-complementary hypergraphs of given order
Characterization of super-radial graphs
Chromatic polynomials of mixed hypercycles
The maximum number of edges in a K r+1 , M k+1 -free graph
Random procedures for dominating sets in bipartite graphs
On super ( a, d )-antimagic total covering of star related graphs
On the vertex position number of graphs
On generalization of the friendship theorem
Simplicial and nonsimplicial complete subgraphs
Weak k-reconstruction of Cartesian products
Associative graph products and their independence, domination and coloring numbers
Some upper bounds on Ramsey numbers involving C 4
Spectral bounds for the zero forcing number of a graph
Elimination properties for minimal dominating sets of graphs
Labeled packing of cycles and circuits
On antipodal and diametrical partial cubes
Distance perfectness of graphs
Futher results on sequetially additive graphs
Disjoint 5-cycles in a graph
On link-irregular graphs
On graphs all of whose {C 3 , T 3 }-free arc colorations are kernel-perfect
Total domination versus paired domination
Maximal buttonings of trees
The generalized 4-connectivity of balanced hypercubes
Independence number and packing coloring of generalized Mycielski graphs
General sharp upper bounds on the total coalition number
Magic and supermagic dense bipartite graphs
On the uniqueness of D -vertex magic constant
Graphs with small additive stretch number
On normal partitions in cubic graphs
Hamiltonicities of double domination critical and stable claw-free graphs
On the n -partite tournaments with exactly n-m+1 cycles of length m
On decomposing the complete symmetric digraph into orientations of K 4 -e
Decomposition of complete multigraphs into stars and cycles
A survey on the cyclic coloring and its relaxations
Convex and weakly convex domination in prism graphs
Facial [r.s, t] -colorings of plane graphs
The smallest nonevasive graph property
On the existence of a cycle of length at least 7 in a (1, \le 2) -twin-free graph
New classes of critical kernel-imperfect digraphs
Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs
Geodetic sets in graphs
Packing the hypercube
Dense arbitrarily partitionable graphs
The m -bipartite Ramsey number BR m (H 1 ,H 2 )
An oriented version of the 1-2-3 Conjecture
The threshold dimension and irreducible graphs
About (k, l) -kernels, semikernels and Grundy functions in partial line digraphs
Some variations of perfect graphs
Problems on fully irregular digraphs
Sharp bounds for the number of matchings in generalized-theta-graphs
Gregarious kite factorization of tensor product of complete graphs
Uniquely partitionable planar graphs with respect to properties having a forbidden tree
Distribution of contractible edges and the structure of noncontracible edges having endvertices with large degree in a 4-connected graph
Graph Domination in Distance Two
Packing of three copies of a digraph into the transitive tournament
Domination in functigraphs
Alternating-pancyclism in 2-edge-colored graphs
Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph
Signed total Roman edge domination in graphs
A note on uniquely H -colorable graphs
Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten
Towards a characterization of bipartite switching classes by means of forbidden subgraphs
A few examples and counterexamples in spectral graph theory
A short proof for a lower bound on the zero forcing number
Nordhaus-Gaddum-type results for resistance distance-based graph invariants
Spanning trails avoiding and containing given edges
Connected coalitions in graphs
An inductive proof of Whitney's Broken Circuit Theorem
On q -power cycles in cubic graphs
Determining number and cost of generalized Mycielskian graphs
Maximum cycle packing in Eulerian graphs using local traces
The first player wins the one-colour triangle avoidance game on 16 vertices
New bounds on the signed total domination number of graphs
The Wiener number of Kneser graphs
A linear algorithms for the two paths problem on permutation graphs
Frequency planning and ramifications of coloring
Intersection graph of gamma sets in the total graph
All tight descriptions of 3-stars in 3-polytopes with girth 5
Uniquely partitionable graphs
On characterization of uniquely 3-list colorable complete multipartite graphs
Distance-locally disconnected graphs
The 3-rainbow index of a graph
The crossing numbers of join of some graphs with n isolated vertices
Vertices contained in all or in no minimum semitotal dominating set of a tree
The hull number of strong product graphs
A new proof that 4-connected planar graphs are Hamiltonian-connected
A constructive extension of the characterization on potentially K s, t -bigraphic pairs
Decompositions of a complete multidigraph into almost arbitrary paths
Arithmetic labelings and geometric labelings of countable graphs
A neighborhood condition for fractional ID-[ a, b ]-factor-critical graphs
On some properties of antipodal partial cubes
Strong incidence colouring of graphs
Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph
On distance local connectivity and vertex distance colouring
On the crossing numbers of Cartesian products of stars and graphs of order six
Long cycles and neighborhood union in 1-tough graphs with large degree sums
Beta invariant and chromatic uniqueness of wheels
Closed formulae for the strong metric dimension of lexicographic product graphs
On the factorization of reducible properties of graphs into irreducible factors
Supermagic graphs with many different degrees
Trees with Α -labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees
The minimum spetral radius of signless Laplacian of graphs with a given clique number
Generalized fractional total coloring of complete graphs
Remarks on the existence of uniquely partitionable planar graphs
On the domination number of prisms of graphs
The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
On decomposing regular graphs into isomorphic double-stars
k -kernels in generalizations of transitive digraphs
Panchromatic patterns by paths
Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs
A note on the Ramsey number and the planar Ramsey number for C4 and complete graphs
Minimally strong subgraph (k, ℓ)-arc-connected digraphs
The connectivity of domination dot-critical graphs with no critical vertices
Rainbow connection in sparse graphs
On degree sets and the minimum orders in bipartite graphs
Double domination critical and stable graphs upon vertex removal
Edge colorings and total colorings of integer distance graphs
Linear arboricity of 1-planar graphs
A note on longest paths in circular arc graph
A degree condition implying Ore-type condition for even [2, b] -factors in graphs
Constrained colouring and σ-hypergraphs
Incidence coloring-cold cases
Maximal Hypergraphs with Respect to the Bounded Cost Hereditary Property
Adjacent vertex strongly distinguishing total coloring of graphs with lower average degree
Some progress on the double Roman domination in graphs
On transitive orientations of G-e
Edge-transitive lexicographic and Cartesian products
Rainbow connection number of graphs with diameter 3
On Domination in Graphs
Total edge irregularity strength of trees
Weak saturation numbers for sparse graphs
On the structural result on normal plane maps
Some additions to the theory of star partitions of graphs
On the displacement of eigenvalues when removing a twin vertex
On the structure of plane graphs of minimum face size 5
Forbidden subgraphs for hamiltonicity of 1-tough graphs
On Ramsey (K 1, 2 , C 4 ) -minimal graphs
Closed k -stop distance in graphs
The Turán number of three disjoint paths
On the total restrained domination number of direct products of graphs
An upper bound on the Laplacian spectral radius of the signed graphs
A maximum resonant set of polyomino graphs
On Vizing's conjecture
The crossing numbers of join products of paths with graphs of order four
Strong Tutte type conditions and factors of graphs
A note on strongly multiplicative graphs
Relating 2-rainbow domination to Roman domination
Rainbow connectivity of cacti and some infinite digraphs
Some sufficient conditions on odd directed cycles of bounded length for the existence of a kernel
Hamiltonian extendable graphs
Monochromatic paths and monochromatic sets of arcs in bipartite tournaments
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
Criteria of the existence of uniquely partionable graphs with respect to additive induced-hereditary properties
Prime factorization and domination in the hierarchical product of graphs
Changing and unchanging of the domination number of a graph: path addition numbers
Connected global offensive k -alliances in graphs
Comparing eccentricity-based graph invariants
The Turán number of spanning star forests
Matchings extend to Hamiltonian cycles in 5-cube
Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs
On the maximum and minimum sizes of a graph with given k -connectivity
On the numbers of cut-vertices and end-blocks in 4-regular graphs
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
Covering the edges of a random hypergraph by cliques
Unique factorization theorem
Graphs for n -circular matroids
Facial rainbow coloring of plane graphs
Lower bounds for the domination number
Graph classes equivalent to 12-representable graphs
A note on uniquely embeddable graphs
Destroying symmetry by orienting edges: Complete graphs and complete bigraphs
The k -rainbow bondage number of a digraph
Some totally 4-choosable multigraphs
On the non-( p-1 )-partite K p -free graphs
Daisy Hamming graphs
Domination Subdivision Numbers
Broken circuits in matroids-Dohmen's inductive proof
The distance Roman domination numbers of graphs
Arankings of trees
Turan's theorem implies Stanley's bound
Balanced problems on graphs with categorization of edges
On the equality of domination number and 2-domination number
Detour Chromatic Numbers
On Selkow's bound on the independence number of graphs
Bounds for b -chromatic number of subgraphs and edge-deleted subgraphs
k -Kernels and some operations in digraphs
Star-cycle factors of graphs
Hamiltonian normal Cayley graphs
An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles
Note on Split Domination Number of the Cartesian Product of Paths
Flippable edges in triangulations on surfaces
Power domination in Knödel graphs and Hanoi graphs
On multiset colorings of graphs
On the total k -domination in graphs
Hamiltonicity and generalised total colourings of planar graphs
Bounds on the global double Roman domination number in graphs
Kernels in edge coloured line digraph
The Cycle-Complete Graph Ramsey Number r (C 5 , K 7 )
(I, F) -partition of planar graphs without cycles of length 4, 6, or 9
Core index of perfect matching polytope for a 2-connected cubic graph
Relations between the domination parameters and the chromatic index of a graph
Restrained differential of a graph
On γ -labelings of trees
Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common
On the weight of minor faces in triangle-free polytopes
On the simplex graph operator
On the ρ-subdivision number of graphs
Generalised irredundance in graphs: Nordhaus-Gaddum bounds
Isomorphisms and traversability of directed path graphs
Efficient (j, k)- domination
Fractional ( P, Q )-total list colorings of graphs
Stable sets for ( P 6 , K 2, 3 )-free graphs
Completely independent spanning trees in k -th power of graphs
Minimum congestion spanning trees of grids and discrete toruses
Partitions of a graph into cycles containing a specified linear forest
Bounds on the global offensive k -alliance number in graphs
Monochromatic kernel-perfectness of special classes of digraphs