Pages that link to "Item:Q2725179"
From MaRDI portal
The following pages link to Discussiones Mathematicae Graph Theory (Q2725179):
Displayed 50 items.
- On domination of Cartesian product of directed cycles: Results for certain equivalence classes of lengths (Q2860867) (← links)
- A characterization of trees for a new lower bound on the k-independence number (Q2860868) (← links)
- On closed modular colorings of trees (Q2860869) (← links)
- Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs (Q2860870) (← links)
- Edge dominating sets and vertex covers (Q2860871) (← links)
- Two short proofs on total domination (Q2860872) (← links)
- A tight bound on the set chromatic number (Q2860873) (← links)
- The path-distance-width of hypercubes (Q2860874) (← links)
- The i-chords of cycles and paths (Q2866409) (← links)
- 4-chromatic Koester graphs (Q2866410) (← links)
- On the total restrained domination number of direct products of graphs (Q2866411) (← links)
- Double domination critical and stable graphs upon vertex removal (Q2866412) (← links)
- Structural results on maximal k-degenerate graphs (Q2866413) (← links)
- On the dominator colorings in trees (Q2866414) (← links)
- Minimal trees and monophonic convexity (Q2866415) (← links)
- Hamiltonian-colored powers of strong digraphs (Q2866416) (← links)
- Minimal rankings of the Cartesian product K_{n}□ K_{m} (Q2866417) (← links)
- On properties of maximal 1-planar graphs (Q2866418) (← links)
- Wiener and vertex PI indices of the strong product of graphs (Q2866419) (← links)
- Sharp bounds for the number of matchings in generalized-theta-graphs (Q2866420) (← links)
- On the rainbow connection of Cartesian products and their subgraphs (Q2866421) (← links)
- The S-packing chromatic number of a graph (Q2866422) (← links)
- Convex universal fixers (Q2866423) (← links)
- On the non-(p-1)-partite K_{p}-free graphs (Q2866445) (← links)
- Coloring some finite sets in {R}^{n} (Q2866446) (← links)
- Universality for and in induced-hereditary graph properties (Q2866447) (← links)
- A note on the uniqueness of stable marriage matching (Q2866448) (← links)
- When is an incomplete 3× n latin rectangle completable? (Q2866449) (← links)
- On vertices enforcing a Hamiltonian cycle (Q2866450) (← links)
- Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree (Q2866451) (← links)
- On minimum (K_q,k) stable graphs (Q2866452) (← links)
- A survey of the Path Partition Conjecture (Q2866454) (← links)
- A note on Barnette's Conjecture (Q2866455) (← links)
- On graphs with disjoint dominating and 2-dominating sets (Q2866456) (← links)
- On maximum weight of a bipartite graph of given order and size (Q2866457) (← links)
- Fractional ({ P},{ Q})-total list colorings of graphs (Q2866458) (← links)
- Rainbow connection in sparse graphs (Q2866459) (← links)
- A note on uniquely embeddable forests (Q2866461) (← links)
- Distance-locally disconnected graphs (Q2866462) (← links)
- Sums of powered characteristic roots count distance-independent circular sets (Q2866463) (← links)
- Choice-perfect graphs (Q2866464) (← links)
- On the forcing geodetic and forcing Steiner numbers of a graph (Q2906350) (← links)
- Some results on semi-total signed graphs (Q2906351) (← links)
- Complete minors, independent sets, and chordal graphs (Q2906352) (← links)
- Oriented colouring of some graph products (Q2906353) (← links)
- Characterization of trees with equal 2-domination number and domination number plus two (Q2906354) (← links)
- Connected global offensive k-alliances in graphs (Q2906355) (← links)
- Upper bounds on the b-chromatic number and results for restricted graph classes (Q2906356) (← links)
- Wiener index of the tensor product of a path and a cycle (Q2906357) (← links)
- Spanning tree congestion of rook's graphs (Q2906358) (← links)