Pascal-Francis CNRS

Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Complete bipartite graph")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 36

  • Page / 2
Export

Selection :

  • and

Profile minimization on products of graphsTSAO, Yu-Ping; CHANG, Gerard J.Discrete mathematics. 2006, Vol 306, Num 8-9, pp 792-800, issn 0012-365X, 9 p.Article

On the crossing numbers of Km□Cn and Km,l□PnZHENG WENPING; LIN XIAOHUI; YANG YUANSHENG et al.Discrete applied mathematics. 2008, Vol 156, Num 10, pp 1892-1907, issn 0166-218X, 16 p.Article

A note on the Ramsey number of K2,2 versus K3,nLORTZ, Roland.Discrete mathematics. 2006, Vol 306, Num 22, pp 2976-2982, issn 0012-365X, 7 p.Article

Unbalanced bipartite factorizations of complete bipartite graphsMARTIN, Nigel.Discrete mathematics. 2006, Vol 306, Num 17, pp 2084-2090, issn 0012-365X, 7 p.Article

Decomposition of Km,n into 4-cycles and 2t-cyclesCHOU, Chao-Chih; FU, Chin-Mei.Journal of combinatorial optimization. 2007, Vol 14, Num 2-3, pp 205-218, issn 1382-6905, 14 p.Conference Paper

One edge union of shell graphs and one vertex union of complete bipartite graphs are cordialSETHURAMAN, G; SELVARAJU, P.Discrete mathematics. 2002, Vol 259, Num 1-3, pp 343-350, issn 0012-365X, 8 p.Article

The adjacent strong edge chromatic number of P1 ∨ Km,n and C2 ∨ Km,nZONGJIAN SUN; JING CHEN.International journal of modelling, identification and control (Print). 2011, Vol 13, Num 3, pp 221-224, issn 1746-6172, 4 p.Article

CYCLE SYSTEMS IN THE COMPLETE BIPARTITE GRAPH PLUS A ONE-FACTORLIQUN PU; HAO SHEN; JUN MA et al.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 4, pp 1083-1092, issn 0895-4801, 10 p.Article

Heterochromatic tree partition numbers for complete bipartite graphsHE CHEN; ZEMIN JIN; XUELIANG LI et al.Discrete mathematics. 2008, Vol 308, Num 17, pp 3871-3878, issn 0012-365X, 8 p.Article

On the signed edge domination number of graphsAKBARI, S; BOLOUKI, S; HATAMI, P et al.Discrete mathematics. 2009, Vol 309, Num 3, pp 587-594, issn 0012-365X, 8 p.Conference Paper

?5 -factorization of complete bipartite graphsJIAN WANG; BEILIANG DU.Discrete mathematics. 2008, Vol 308, Num 9, pp 1665-1673, issn 0012-365X, 9 p.Article

Blockers and transversalsZENKLUSEN, R; RIES, B; PICOULEAU, C et al.Discrete mathematics. 2009, Vol 309, Num 13, pp 4306-4314, issn 0012-365X, 9 p.Article

Induced-path partition on graphs with special blocksPAN, Jun-Jie; CHANG, Gerard J.Theoretical computer science. 2007, Vol 370, Num 1-3, pp 121-130, issn 0304-3975, 10 p.Article

Regular hamiltonian embeddings of Kn,n and regular triangular embeddings of Kn,n,nKNOR, Martin; SIRAN, Jozef.Discrete mathematics. 2008, Vol 308, Num 20, pp 4796-4800, issn 0012-365X, 5 p.Article

A note on the domination dot-critical graphsCHEN, Xue-Gang; WAI CHEE SHIU.Discrete applied mathematics. 2009, Vol 157, Num 18, pp 3743-3745, issn 0166-218X, 3 p.Article

A study on cyclic bandwidth sumCHEN, Ying-Da; YAN, Jing-Ho.Journal of combinatorial optimization. 2007, Vol 14, Num 2-3, pp 295-308, issn 1382-6905, 14 p.Conference Paper

Chaotic numbers of complete bipartite graphs and tripartite graphsCHIANG, N. P.Journal of optimization theory and applications. 2006, Vol 131, Num 3, pp 485-491, issn 0022-3239, 7 p.Article

Invalid proofs on incidence coloringSHIU, W. C; SUN, P. K.Discrete mathematics. 2008, Vol 308, Num 24, pp 6575-6580, issn 0012-365X, 6 p.Article

Reduction of symmetric semidefinite programs using the regular *-representationDE KLERK, Etienne; PASECHNIK, Dmitrii V; SCHRIJVER, Alexander et al.Mathematical programming. 2007, Vol 109, Num 2-3, pp 613-624, issn 0025-5610, 12 p.Conference Paper

On k-planar crossing numbersSHAHROKHI, Farhad; SYKORA, Ondrej; SZEKELY, Laszlo A et al.Discrete applied mathematics. 2007, Vol 155, Num 9, pp 1106-1115, issn 0166-218X, 10 p.Conference Paper

Path partition for graphs with special blocksPAN, Jun-Jie; CHANG, Gerard J.Discrete applied mathematics. 2005, Vol 145, Num 3, pp 429-436, issn 0166-218X, 8 p.Article

A solvable case of image reconstruction in discrete tomographyCOSTA, M. C; DE WERRA, D; PICOULEAU, C et al.Discrete applied mathematics. 2005, Vol 148, Num 3, pp 240-245, issn 0166-218X, 6 p.Article

On bipartite zero-divisor graphsLU DANCHENG; WU TONGSUO.Discrete mathematics. 2009, Vol 309, Num 4, pp 755-762, issn 0012-365X, 8 p.Article

Cycle decompositions of kn,n -iJUN MA; LIQUN PU; HAO SHEN et al.SIAM journal on discrete mathematics (Print). 2007, Vol 20, Num 3, pp 603-609, issn 0895-4801, 7 p.Article

The linear 3-arboricity of Kn,n and KnFU, Hung-Lin; HUANG, Kuo-Ching; YEN, Chih-Hung et al.Discrete mathematics. 2008, Vol 308, Num 17, pp 3816-3823, issn 0012-365X, 8 p.Article

  • Page / 2