Results 51 to 60 of about 1,862,441 (301)

Minimizing the oriented diameter of a planar graph

, 2009
We consider the problem of minimizing the diameter of an orientation of a planar graph. A result of Chvátal and Thomassen shows that for general graphs, it is NP-complete to decide whether a graph can be oriented so that its diameter is at most two.
Noble, SD, Noble, Steven, Eggemann, N, Eggemann, N.   +3 more
core   +1 more source

Grid Minors of Graphs on the Torus

Journal of Combinatorial Theory, Series B, 1994
The face-width of a graph embedded on the torus is the smallest \(n\) such that there is a noncontractible cycle on the torus which intersects the graph in exactly \(n\) points. For example, the product of two \(n\)-cycles \(C_ n\times C_ n\) embeds on the torus with face-width \(n\); this embedding is called the toroidal \(n\)-grid. A graph \(H\) is a
de Graaf, M., Schrijver, A.
openaire   +4 more sources

Graphs with no $\bar P_7$-Minor [PDF]

The Electronic Journal of Combinatorics, 2016
Let $\bar P_7$ denote the complement of a path on seven vertices. We determine all 4-connected graphs that do not contain $\bar P_7$ as a minor.
Guoli Ding, Chanun Lewchalermvongs, John Maharry   +2 more
openaire   +2 more sources

The complexity of two graph orientation problems

, 2012
This is the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 ElsevierWe consider two orientation problems in a graph, namely the minimization of the sum of all the shortest path ...
Noble, Steven D., Noble, SD, Noble, Steven, Eggemann, N, Eggemann, Nicole, Nicole Eggemann, Eggemann, N., Steven D. Noble   +7 more
core   +1 more source

Unavoidable topological minors of infinite graphs

, 2010
This is the post-print version of the Article - Copyright @ 2010 ElsevierA graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite ...
Ding, Guoli, Chun, Carolyn, Ding, G, Carolyn Chun, Guoli Ding, Chun, C   +5 more
core   +1 more source

Clique Minors in Graphs and Their Complements

Journal of Combinatorial Theory, Series B, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruce A. Reed, Robin Thomas 0001
openaire   +1 more source

Fork-decompositions of matroids [PDF]

, 2004
For the abstract of this paper, please see the PDF ...
Whittle, G, Oxley, James, Oxley, J, Semple, C., Whittle, G., Whittle, Geoff, Hall, Rhiannon, Hall, R., Semple, Charles, Semple, C, Oxley, J., Hall, R   +11 more
core   +1 more source

Models of Klein Surface Obstruction Graphs

Кібернетика та комп'ютерні технології
The task of researching the structure of graphs of given connectivity, which are obstructions for a given surface of non-oriented kind, and building their models, from which obstruction graphs are formed by removing or compressing a set of edges, is ...
Volodymyr Petrenjuk, Dmytro Petreniuk
doaj   +1 more source

On graph contractions and induced minors [PDF]

Discrete Applied Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pim van 't Hof, Marcin Kaminski 0001, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos   +4 more
openaire   +4 more sources

Infection Control Practices for Vascular Access Management in Hemodialysis: Results From a Nationwide Survey of Japanese National University Hospitals

Therapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Bloodstream infections due to repeated vascular access (VA) puncture and circuit connections remain major concerns in hemodialysis. Therefore, we examined current practices for glove, disinfectant, and personal protective equipment (PPE) use according to VA type in national university hospitals in Japan.
Aiko Yamada, Makoto Harada, Tadahiko Kikugawa, Takeshi Nakata, Koji Hashimoto, Tsuneo Konta, Yuji Kamijo   +6 more
wiley   +1 more source