Results 241 to 250 of about 137,342 (261)
Edge Intersection Graphs of L-Shaped Paths in Grids
Electronic Notes in Discrete Mathematics, 2013 Kathie Cameron +2 more
openalex +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
T‐joins intersecting small edge‐cuts in graphs
Journal of Graph Theory, 2007AbstractIn an earlier paper 3, we studied cycles in graphs that intersect all edge‐cuts of prescribed sizes. Passing to a more general setting, we examine the existence of T‐joins in grafts that intersect all edge‐cuts whose size is in a given set A ⊆{1,2,3}.
Kaiser, Tomáš, Škrekovski, Riste
openaire +1 more source
Removing edge-node intersections in drawings of graphs
Information Processing Letters, 2002The algorithms for removing edge-node intersections in drawings of graphs were analyzed. The nodes were used to represent subgraphs which were unpredictable in size and shapes. The application of the classical algorithms to practical graphs resulted in overlapping nodes and edge node intersections.
Eades, Peter, Lai, Wei
openaire +3 more sources
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
SIAM Journal on Discrete Mathematics, 2002Summary: Let \(G\) be a planar graph without two triangles sharing a common vertex. We prove that (1) \(G\) is 4-choosable and (2) \(G\) is edge-\((\Delta(G)+1)\)-choosable when its maximum degree \(\Delta(G)\neq 5\).
Wang, Wei-Fan, Lih, Ko-Wei
openaire +1 more source
On the stability number of the edge intersection of two graphs
Information Processing Letters, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ARBIB, CLAUDIO, A. CAPRARA
openaire +3 more sources
Some properties of edge intersection graphs of single bend paths on a grid
Electronic Notes in Discrete Mathematics, 2009 Bernard Ries
openalex +3 more sources
Edge Intersection Graphs of Paths on a Grid
2019We investigate the class of vertex intersection graphs of paths on a grid, and specifically consider the subclasses that are obtained when each path in the representation has at most k bends (turns). We call such a subclass the Bk-VPG graphs, kC 0.
Martin Charles Golumbic +1 more
openaire +1 more source
A note on edge-choosability of planar graphs without intersecting 4-cycles
Journal of Applied Mathematics and Computing, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ma, Qiaoling +3 more
openaire +1 more source
Onconephrology: The intersections between the kidney and cancer
Ca-A Cancer Journal for Clinicians, 2021Mitchell H Rosner +2 more
exaly
Edge intersection graphs of systems of paths on a grid with a bounded number of bends
Discrete Applied Mathematics, 2009Andrei Asinowski
exaly