Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Coloring of G²-G, for Euclidesian graph G: Label: en
The distance Roman domination numbers of graphs: Label: en
Sharp uppper and lower bounds on the number of spanning trees in Cartesian product graphs: Label: en
Almost -rainbow edge-colorings of some small graphs: Label: en
Precise upper bound for the strong edge chromatic number of sparse planar graphs: Label: en
The b-domatic number of a graph: Label: en
Path-neigborhood graphs: Label: en
Bounds on the signed 2-independence number in graphs: Label: en
Symmetric Hamilton cycle decompositions of complete multigraphs: Label: en
Weak saturation numbers for sparse graphs: Label: en
Generalized fractional total coloring of complete graphs: Label: en
The phylogeny graphs of double partial orders: Label: en
Some sharp bounds on the negative decision number of graphs: Label: en
Characterizations of the family of all generalized line graphs-finite and infinite- and classification of the family of all graphs whose least eigenvalues \ge - 2: Label: en
On graphs G for which both G and G are claw-free: Label: en
Highly connected counterexamples to a conjecture on α -domination: Label: en
On a sphere of influence graph in a one-dimensional space: Label: en
On short cycles through prescribed vertices of a polyhedral graph: Label: en
Kernels in monochromatic path digraphs: Label: en
An upper bound of the basis number of the strong product of graphs: Label: en
A note on maximal common subgraphs of the Dirac's family of graphs: Label: en
On γ-labelings of trees: Label: en
On the p-domination number of cactus graphs: Label: en
On a conjecture of Quintas and arc-traceability in upset tournaments: Label: en
The directed path partition conjecture: Label: en
Decompositions into two paths: Label: en
Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees: Label: en
Hamilton decompositions of line graphs of some bipartite graphs: Label: en
Exact double domination in graphs: Label: en
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs: Label: en
Mycielskians and matchings: Label: en
Domination and leaf density in graphs: Label: en
A Tandem version of the Cops and Robber Game played on products of graphs: Label: en
Connected odd dominating sets in graphs: Label: en
Wiener index of generalized stars and their quadratic line graphs: Label: en
Optimal edge ranking of complete bipartite graphs in polynomial time: Label: en
Decomposing complete graphs into cubes: Label: en
A prime factor theorem for a generalized direct product: Label: en
On the basic number and the minimum cycle bases of the wreath product of some graphs I.: Label: en
Some results on total domination in direct products of graphs: Label: en
The use of Euler's formula in (3,1)*-list-coloring: Label: en
Leaps: an approach to the block structure of a graph: Label: en
Chvátal's Condition cannot hold for both a graph and its complement: Label: en
Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph: Label: en
Special integral variation of trees: Label: en
A charaterization of planar median graphs: Label: en
Extension of several sufficient conditions for Hamiltonian graphs: Label: en
An anti-Ramsey Theorem on edge-cutsets: Label: en
Algorithmic aspects of total k-subdomination in graphs: Label: en
Kernels in the closure of coloured digraphs: Label: en