I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
Cameron, Kathie
75
results:
Search for persons
X
Format
Online (75)
Mediatypes
Articles (Online) (43)
Bookchapter (Online) (3)
OpenAccess-fulltext (29)
Sorted by: Relevance
Sorted by: Year
?
1
Reconfiguration of vertex colouring and forbidden induced s..:
Belavadi, Manoj
;
Cameron, Kathie
;
Merkel, Owen
European Journal of Combinatorics. 118 (2024) - p. 103908 , 2024
Link:
https://doi.org/10.1016/..
?
2
A PPA parity theorem about trees in a bipartite graph:
Cameron, Kathie
;
Edmonds, Jack
Discrete Applied Mathematics. 308 (2022) - p. 107-110 , 2022
Link:
https://doi.org/10.1016/..
?
3
A parity theorem about trees with specified degrees:
Cameron, Kathie
Discrete Applied Mathematics. 305 (2021) - p. 48-55 , 2021
Link:
https://doi.org/10.1016/..
?
4
An optimal χ‐bound for (P6, diamond)‐free graphs:
Cameron, Kathie
;
Huang, Shenwei
;
Merkel, Owen
Journal of Graph Theory. 97 (2021) 3 - p. 451-465 , 2021
Link:
https://doi.org/10.1002/..
?
5
k-Critical graphs in P5-free graphs:
Cameron, Kathie
;
Goedgebeur, Jan
;
Huang, Shenwei
.
Theoretical Computer Science. 864 (2021) - p. 80-91 , 2021
Link:
https://doi.org/10.1016/..
?
6
k-Critical Graphs in $$P_5$$-Free Graphs:
, In:
Lecture Notes in Computer Science; Computing and Combinatorics
,
Cameron, Kathie
;
Goedgebeur, Jan
;
Huang, Shenwei
. - p. 411-422 , 2020
Link:
https://doi.org/10.1007/..
?
7
Cycles containing all the odd-degree vertices:
Cameron, Kathie
;
Thomassen, Carsten
Journal of Combinatorial Theory, Series B. 143 (2020) - p. 219-225 , 2020
Link:
https://doi.org/10.1016/..
?
8
A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS:
CAMERON, KATHIE
;
HUANG, SHENWEI
;
MERKEL, OWEN
Bulletin of the Australian Mathematical Society. 100 (2019) 2 - p. 182-188 , 2019
Link:
https://doi.org/10.1017/..
?
9
The class of (P7,C4,C5)‐free graphs: Decomposition, algorit..:
Cameron, Kathie
;
Huang, Shenwei
;
Penev, Irena
.
Journal of Graph Theory. 93 (2019) 4 - p. 503-552 , 2019
Link:
https://doi.org/10.1002/..
?
10
Solving the clique cover problem on (bull, C4)-free graphs:
Cameron, Kathie
;
Hoàng, Chính T.
Discrete Applied Mathematics. 261 (2019) - p. 119-122 , 2019
Link:
https://doi.org/10.1016/..
?
11
Structure and algorithms for (cap, even hole)-free graphs:
Cameron, Kathie
;
da Silva, Murilo V.G.
;
Huang, Shenwei
.
Discrete Mathematics. 341 (2018) 2 - p. 463-473 , 2018
Link:
https://doi.org/10.1016/..
?
12
On the structure of (pan, even hole)-free graphs:
Cameron, Kathie
;
Chaplick, Steven
;
Hoàng, Chính T.
Journal of Graph Theory. 87 (2017) 1 - p. 108-129 , 2017
Link:
https://doi.org/10.1002/..
?
13
Edge intersection graphs of L-shaped paths in grids:
Cameron, Kathie
;
Chaplick, Steven
;
Hoàng, Chính T.
Discrete Applied Mathematics. 210 (2016) - p. 185-194 , 2016
Link:
https://doi.org/10.1016/..
?
14
Edge Intersection Graphs of L-Shaped Paths in Grids:
Cameron, Kathie
;
Chaplick, Steven
;
Hoàng, Chính T.
Electronic Notes in Discrete Mathematics. 44 (2013) - p. 363-369 , 2013
Link:
https://doi.org/10.1016/..
?
15
Coloring vertices of a graph or finding a Meyniel obstructi..:
Cameron, Kathie
;
Lévêque, Benjamin
;
Maffray, Frédéric
Theoretical Computer Science. 428 (2012) - p. 10-17 , 2012
Link:
https://doi.org/10.1016/..
1-15