The following pages link to Mekkia Kouider (Q168584):
Displaying 50 items.
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph (Q354444) (← links)
- The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs (Q477335) (← links)
- On the b-coloring of tight graphs (Q512879) (← links)
- Stability number and even \([2,b]\)-factors in graphs (Q547550) (← links)
- On mean distance and girth (Q608268) (← links)
- Coverings of the vertices of a graph by small cycles (Q879941) (← links)
- On quasi-monotonous graphs (Q897599) (← links)
- Covering the vertices of a graph with cycles of bounded length (Q1025448) (← links)
- On pseudo 2-factors (Q1028474) (← links)
- Partition of odd regular graphs into bistars (Q1052342) (← links)
- (Q1262878) (redirect page) (← links)
- On the existence of a matching orthogonal to a 2-factorization (Q1262879) (← links)
- Cycles in graphs with prescribed stability number and connectivity (Q1322027) (← links)
- Connected \([a,b]\)-factors in graphs (Q1603263) (← links)
- On pancyclism in Hamiltonian graphs (Q1613475) (← links)
- Connected factors in graphs -- a survey (Q1777234) (← links)
- Hamiltonism and partially square graphs (Q1808710) (← links)
- Some bounds for the \(b\)-chromatic number of a graph (Q1849931) (← links)
- Factorisations of 4-regular graphs and Petersen's theorem (Q1892840) (← links)
- Gallai's conjecture for disconnected graphs (Q1970699) (← links)
- New bounds for the \(b\)-chromatic number of vertex deleted graphs (Q2243141) (← links)
- On the \(b\)-coloring of \(G - e\) (Q2345629) (← links)
- Stability number and \(f\)-factors in graphs (Q2441358) (← links)
- Claws in digraphs (Q2473004) (← links)
- Bounds for the b-chromatic number of some families of graphs (Q2488938) (← links)
- Covering cycles and \(k\)-term degree sums (Q2563515) (← links)
- On the \(b\)-dominating coloring of graphs (Q2576347) (← links)
- Two-edge-connected \([2,k]\)-factors in graphs (Q2708242) (← links)
- On weighted mean distance (Q2712522) (← links)
- On lower bounds for the \(b\)-chromatic number of connected bipartite graphs (Q2840743) (← links)
- Average distance in the strong product of graphs (Q2878207) (← links)
- Even factors of large size (Q2922216) (← links)
- Regular path decompositions of odd regular graphs (Q3553228) (← links)
- (Q3565952) (← links)
- (Q3718751) (← links)
- (Q3758868) (← links)
- Edge-vulnerability and mean distance (Q3826594) (← links)
- (Q4145828) (← links)
- Erratum: Mean distance and minimum degree (Q4237733) (← links)
- Decomposition of multigraphs (Q4254306) (← links)
- (Q4262251) (← links)
- Covering vertices by cycles (Q4317218) (← links)
- Mean distance and minimum degree (Q4337509) (← links)
- (Q4405642) (← links)
- (Q4449290) (← links)
- (Q4487447) (← links)
- Edge $k$-$q$-Colorability of Graphs (Q4637664) (← links)
- Even [a,b]-factors in graphs (Q4668428) (← links)
- Stability number and [<i>a,b</i>]‐factors in graphs (Q4810500) (← links)
- Degree Sums and Covering Cycles (Q4857441) (← links)
