Journal of graph theory文章索引

期刊名：Journal of graph theory

缩写：J GRAPH THEOR

ISSN：0364-9024

e-ISSN：1097-0118

IF/分区：1.0/Q2

共收录本刊相关文章索引2595条

Recursive generation of partitionable graphs [0.03%]

E. Boros; V. Gurvich; S. Hougardy E. Boros; V. Gurvich; S. Hougardy

Journal of graph theory. 2002;41(4):259-285. DOI:10.1002/jgt.10067 2002

Two graphs without planar covers [0.03%]

Dan Archdeacon Dan Archdeacon

Journal of graph theory. 2002;41(4):318-326. DOI:10.1002/jgt.10075 2002

Coloring the square of a planar graph [0.03%]

Jan van den Heuvel; Sean McGuinness Jan van den Heuvel; Sean McGuinness

Journal of graph theory. 2003;42(2):110-124. DOI:10.1002/jgt.10077 2003

On factors of 4-connected claw-free graphs [0.03%]

H. J. Broersma; M. Kriesell; Z. Ryjác̆ek H. J. Broersma; M. Kriesell; Z. Ryjác̆ek

Journal of graph theory. 2001;37(2):125-136. DOI:10.1002/jgt.1008 2001

On removable cycles through every edge [0.03%]

Manoel Lemos; James Oxley Manoel Lemos; James Oxley

Journal of graph theory. 2003;42(2):155-164. DOI:10.1002/jgt.10082 2003

Coloring with three-colored subgraphs [0.03%]

Dhruv Mubayi Dhruv Mubayi

Journal of graph theory. 2003;42(3):193-198. DOI:10.1002/jgt.10083 2003

Nowhere-zero 3-flows in locally connected graphs [0.03%]

Hong-Jian Lai Hong-Jian Lai

Journal of graph theory. 2003;42(3):211-219. DOI:10.1002/jgt.10085 2003

Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number [0.03%]

Lutz Volkmann Lutz Volkmann

Journal of graph theory. 2003;42(3):234-245. DOI:10.1002/jgt.10087 2003

NP completeness of the edge precoloring extension problem on bipartite graphs [0.03%]

Jiří Fiala Jiří Fiala

Journal of graph theory. 2003;43(2):156-160. DOI:10.1002/jgt.10088 2003

Relative length of longest paths and cycles in 3-connected graphs [0.03%]

Rao Li; Akira Saito; R.H. Schelp Rao Li; Akira Saito; R.H. Schelp

Journal of graph theory. 2001;37(3):137-156. DOI:10.1002/jgt.1009 2001