Result 1 to 20 of 1466 total
A sufficient condition for a plane graph with maximum degree 6 to be class 1. (English)
Discrete Appl. Math. 161, No. 1-2, 307-310 (2013).
1
On point-sets that support planar graphs. (English)
Comput. Geom. 46, No. 1, 29-50 (2013).
2
Acyclic edge coloring of planar graphs without small cycles. (English)
Graphs Comb. 28, No. 2, 215-226 (2012).
3
Equitable coloring and equitable choosability of planar graphs without 6- and 7-cycles. (English)
Ars Comb. 103, 333-352 (2012).
4
Accelerated bend minimization. (English)
J. Graph Algorithms Appl. 16, No. 3, 635-650 (2012).
5
List edge and list total coloring of 1-planar graphs. (English)
Front. Math. China 7, No. 5, 1005-1018 (2012).
6
DAGmaps and $ε$-visibility representations for DAGs: algorithms and characterizations. (English)
J. Graph Algorithms Appl. 16, No. 2, 359-380 (2012).
7
Rings whose total graphs have genus at most one. (English)
Rocky Mt. J. Math. 42, No. 5, 1551-1560 (2012).
8
Fast minor testing in planar graphs. (English)
Algorithmica 64, No. 1, 69-84 (2012).
9
Planar flows and quadratic relations over semirings. (English)
J. Algebr. Comb. 36, No. 3, 441-474 (2012).
10
Light edges in 1-planar graphs with prescribed minimum degree. (English)
Discuss. Math., Graph Theory 32, No. 3, 454-556 (2012).
11
New upper bounds on linear coloring of planar graphs. (English)
Acta Math. Sin., Engl. Ser. 28, No. 6, 1187-1196 (2012).
12
Light subgraphs in the family of 1-planar graphs with high minimum degree. (English)
Acta Math. Sin., Engl. Ser. 28, No. 6, 1155-1168 (2012).
13
Spanning tree algorithm for families of chained graphs. (English)
Int. Math. Forum 7, No. 25-28, 1209-1222 (2012).
14
Some Euler-type formulas for planar graphs. (English)
Int. J. Pure Appl. Math. 79, No. 2, 303-308 (2012).
15
Reconfiguration of list edge-colorings in a graph. (English)
Discrete Appl. Math. 160, No. 15, 2199-2207 (2012).
16
Acyclic 4-choosability of planar graphs without adjacent short cycles. (English)
Discrete Math. 312, No. 22, 3335-3341 (2012).
17
Planar graphs of maximum degree six without 7-cycles are class one. (English)
Electron. J. Comb. 19, No. 3, Research Paper P17, 13 p., electronic only (2012).
18
A result on linear coloring of planar graphs. (English)
Inf. Process. Lett. 112, No. 22, 880-884 (2012).
19
The linear arboricity of planar graphs with maximum degree at least 5. (English)
Inf. Process. Lett. 112, No. 20, 767-771 (2012).
20
Result 1 to 20 of 1466 total
Start
Contact
Print
General Help
