The following pages link to Hamamache Kheddouci (Q237443):
Displaying 50 items.
- Component-cardinality-constrained critical node problem in graphs (Q299073) (← links)
- A survey on tree matching and XML retrieval (Q394973) (← links)
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs (Q396595) (← links)
- (Q456891) (redirect page) (← links)
- Gap vertex-distinguishing edge colorings of graphs (Q456892) (← links)
- The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs (Q477335) (← links)
- On the parameterized complexity of the edge monitoring problem (Q509893) (← links)
- Edge monitoring problem on interval graphs (Q510622) (← links)
- A self-stabilizing algorithm for edge monitoring in wireless sensor networks (Q528199) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- New results about set colorings of graphs (Q612965) (← links)
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086) (← links)
- \([r,s,t]\)-colorings of graph products (Q742628) (← links)
- Decomposition of complete multigraphs into stars and cycles (Q891309) (← links)
- \([r,s,t]\)-coloring of trees and bipartite graphs (Q960923) (← links)
- A strict strong coloring of trees (Q989572) (← links)
- A graph b-coloring framework for data clustering (Q1040797) (← links)
- A note on the ``packing of two copies of some trees into their third power'' (Q1431988) (← links)
- \((N, p)\)-equitable \(b\)-coloring of graphs (Q1682874) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Graph grammars according to the type of input and manipulated data: a survey (Q1750316) (← links)
- Packing two copies of a tree into its fourth power (Q1970711) (← links)
- Labeled packing of cycles and circuits (Q2118238) (← links)
- Complexity of edge monitoring on some graph classes (Q2172388) (← links)
- Packing three copies of a tree into its sixth power (Q2243090) (← links)
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← links)
- Saturated boundary \(k\)-alliances in graphs (Q2341725) (← links)
- Dominated colorings of graphs (Q2345536) (← links)
- A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs (Q2353636) (← links)
- On some domination colorings of graphs (Q2399288) (← links)
- Labeled embedding of \((n, n-2)\)-graphs in their complements (Q2409792) (← links)
- A Vizing-like theorem for union vertex-distinguishing edge coloring (Q2410224) (← links)
- Edge coloring total \(k\)-labeling of generalized Petersen graphs (Q2444742) (← links)
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs (Q2446589) (← links)
- On the family of \(r\)-regular graphs with Grundy number \(r+1\) (Q2449171) (← links)
- Labeled 2-packings of trees (Q2514165) (← links)
- The irregularity strength of circulant graphs (Q2576828) (← links)
- Eternal dominating sets on digraphs and orientations of graphs (Q2659065) (← links)
- (Q2816112) (← links)
- (Q2864442) (← links)
- (Q2866609) (← links)
- ON CIRCULAR DISARRANGED STRINGS OF SEQUENCES (Q2968244) (← links)
- On the packing of trees into their power (Q3438974) (← links)
- Grundy coloring for power graphs (Q3439033) (← links)
- Sum coloring of distance and circulant graphs (Q3439341) (← links)
- Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs (Q3455752) (← links)
- Subdivision into i-packings and S-packing chromatic number of some lattices (Q3465668) (← links)
- (Q3565943) (← links)
- A dual of 4-regular graph for<i>G × C<sub>2n</sub></i> (Q4440679) (← links)
- On the packing of two copies of a caterpillar in its third power (Q4458973) (← links)
