Gary Chartrand

From MaRDI portal
Person:230773

Available identifiers

zbMath Open chartrand.garyWikidataQ5524834 ScholiaQ5524834MaRDI QIDQ230773

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61213062024-02-26Paper
Graphs & Digraphs2024-02-02Paper
On Graphs With Prescribed Chromatic Number and Subset Index2023-11-27Paper
https://portal.mardi4nfdi.de/entity/Q60575382023-10-05Paper
https://portal.mardi4nfdi.de/entity/Q61725772023-07-20Paper
https://portal.mardi4nfdi.de/entity/Q61725782023-07-20Paper
A Note on Rainbow Mean Indexes of Paths2022-11-23Paper
Uniformly Connected Graphs — A Survey2022-07-08Paper
https://portal.mardi4nfdi.de/entity/Q50715742022-04-22Paper
Remembering Frank Harary2022-03-09Paper
New directions in Ramsey theory2022-03-09Paper
Stratified Domination2021-12-15Paper
Ramsey sequences of graphs2021-09-01Paper
https://portal.mardi4nfdi.de/entity/Q58553952021-03-18Paper
https://portal.mardi4nfdi.de/entity/Q51219282020-09-22Paper
https://portal.mardi4nfdi.de/entity/Q52105692020-01-21Paper
https://portal.mardi4nfdi.de/entity/Q52063742019-12-18Paper
Chromatic Graph Theory2019-12-10Paper
https://portal.mardi4nfdi.de/entity/Q52440022019-11-19Paper
From Domination to Coloring2019-10-08Paper
https://portal.mardi4nfdi.de/entity/Q52281012019-08-09Paper
On Minimum Spanning Subgraphs of Graphs With Proper Connection Number 22019-07-22Paper
How to Label a Graph2019-05-20Paper
Rainbow disconnection in graphs2018-08-10Paper
https://portal.mardi4nfdi.de/entity/Q45662382018-06-14Paper
Another view of bipartite Ramsey numbers2018-03-23Paper
https://portal.mardi4nfdi.de/entity/Q45908862017-11-20Paper
Stars and their \(k\)-Ramsey numbers2017-08-10Paper
Kaleidoscopic colorings of graphs2017-07-17Paper
Highly Irregular2016-12-16Paper
https://portal.mardi4nfdi.de/entity/Q57407822016-07-20Paper
https://portal.mardi4nfdi.de/entity/Q57409332016-07-20Paper
https://portal.mardi4nfdi.de/entity/Q34510172015-11-10Paper
https://portal.mardi4nfdi.de/entity/Q29511432015-10-09Paper
https://portal.mardi4nfdi.de/entity/Q54971142015-02-03Paper
https://portal.mardi4nfdi.de/entity/Q28782052014-08-28Paper
https://portal.mardi4nfdi.de/entity/Q28782182014-08-28Paper
https://portal.mardi4nfdi.de/entity/Q28754802014-08-15Paper
https://portal.mardi4nfdi.de/entity/Q28693242014-01-03Paper
https://portal.mardi4nfdi.de/entity/Q28396382013-07-12Paper
https://portal.mardi4nfdi.de/entity/Q28396902013-07-12Paper
https://portal.mardi4nfdi.de/entity/Q30892192011-08-24Paper
https://portal.mardi4nfdi.de/entity/Q30156012011-07-13Paper
https://portal.mardi4nfdi.de/entity/Q30125872011-07-06Paper
https://portal.mardi4nfdi.de/entity/Q30654572011-01-06Paper
The sigma chromatic number of a graph2010-12-03Paper
The rainbow connectivity of a graph2010-11-24Paper
Rainbow trees in graphs and generalized connectivity2010-11-24Paper
https://portal.mardi4nfdi.de/entity/Q35888732010-09-10Paper
https://portal.mardi4nfdi.de/entity/Q35816712010-09-02Paper
The set chromatic number of a graph2010-05-14Paper
https://portal.mardi4nfdi.de/entity/Q33927162009-08-17Paper
https://portal.mardi4nfdi.de/entity/Q36355282009-07-06Paper
https://portal.mardi4nfdi.de/entity/Q36160022009-03-24Paper
Recognizable colorings of graphs2008-09-29Paper
https://portal.mardi4nfdi.de/entity/Q35257362008-09-18Paper
Distance defined by spanning trees in graphs2008-06-18Paper
https://portal.mardi4nfdi.de/entity/Q54432772008-02-20Paper
https://portal.mardi4nfdi.de/entity/Q34260642007-03-08Paper
https://portal.mardi4nfdi.de/entity/Q34138732006-12-18Paper
On γ-labelings of trees2006-10-16Paper
https://portal.mardi4nfdi.de/entity/Q54883282006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54883682006-09-14Paper
Uniformly cordial graphs2006-06-30Paper
https://portal.mardi4nfdi.de/entity/Q54660752005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q54633442005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54634622005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54634752005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54635452005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54621472005-08-01Paper
https://portal.mardi4nfdi.de/entity/Q54616912005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q27159782005-07-20Paper
https://portal.mardi4nfdi.de/entity/Q30236552005-07-05Paper
https://portal.mardi4nfdi.de/entity/Q30236612005-07-05Paper
On the dimension of trees2005-06-10Paper
https://portal.mardi4nfdi.de/entity/Q46779332005-05-23Paper
https://portal.mardi4nfdi.de/entity/Q46779632005-05-23Paper
https://portal.mardi4nfdi.de/entity/Q46779802005-05-23Paper
On Hamiltonian colorings of graphs2005-04-18Paper
Distance in graphs -- taking the long view2005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q46655392005-04-11Paper
https://portal.mardi4nfdi.de/entity/Q46623432005-03-30Paper
https://portal.mardi4nfdi.de/entity/Q46537672005-03-07Paper
Hamiltonian colorings of graphs2005-02-22Paper
https://portal.mardi4nfdi.de/entity/Q31585792005-01-27Paper
https://portal.mardi4nfdi.de/entity/Q48288072004-11-26Paper
https://portal.mardi4nfdi.de/entity/Q48262752004-11-11Paper
Radio k-colorings of paths2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q48219412004-10-22Paper
https://portal.mardi4nfdi.de/entity/Q48208102004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q44727172004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44727242004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44703672004-06-22Paper
https://portal.mardi4nfdi.de/entity/Q44647812004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q44439312004-03-30Paper
https://portal.mardi4nfdi.de/entity/Q44575412004-03-25Paper
Distance in stratified graphs2004-03-21Paper
https://portal.mardi4nfdi.de/entity/Q44057572004-01-07Paper
Greedy \(F\)-colorings of graphs2003-12-04Paper
The hull number of an oriented graph2003-12-03Paper
Stratification and domination in graphs2003-11-25Paper
https://portal.mardi4nfdi.de/entity/Q44057762003-11-20Paper
On \(k\)-dimensional graphs and their bases2003-10-14Paper
https://portal.mardi4nfdi.de/entity/Q44308372003-10-13Paper
Graphs of order \(n\) with locating-chromatic number \(n-1\)2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q48028142003-04-23Paper
https://portal.mardi4nfdi.de/entity/Q47943752003-04-11Paper
Boundary vertices in graphs2003-04-09Paper
Extreme Geodesic Graphs2003-03-31Paper
https://portal.mardi4nfdi.de/entity/Q44432432003-01-01Paper
https://portal.mardi4nfdi.de/entity/Q45292482002-11-06Paper
How to Define an Irregular Graph2002-10-17Paper
https://portal.mardi4nfdi.de/entity/Q31513382002-10-15Paper
https://portal.mardi4nfdi.de/entity/Q31513492002-10-15Paper
The Forcing Convexity Number of a Graph2002-10-15Paper
The convexity number of a graph2002-07-29Paper
https://portal.mardi4nfdi.de/entity/Q43290652002-07-22Paper
https://portal.mardi4nfdi.de/entity/Q27651702002-07-22Paper
https://portal.mardi4nfdi.de/entity/Q45294432002-07-14Paper
https://portal.mardi4nfdi.de/entity/Q27250092002-07-14Paper
Convexity in oriented graphs2002-07-03Paper
https://portal.mardi4nfdi.de/entity/Q27253232002-06-30Paper
https://portal.mardi4nfdi.de/entity/Q27443712002-06-30Paper
The Steiner number of a graph2002-06-24Paper
On the geodetic number of a graph2002-04-08Paper
On graphs with a unique minimum hull set2002-03-24Paper
Full domination in graphs2002-03-24Paper
The ultracenter and central fringe of a graph2002-03-06Paper
The decomposition dimension of graphs2002-02-19Paper
https://portal.mardi4nfdi.de/entity/Q27704422002-02-07Paper
On the out-domination and in-domination numbers of a digraph2002-01-27Paper
https://portal.mardi4nfdi.de/entity/Q27165222002-01-08Paper
https://portal.mardi4nfdi.de/entity/Q27609122001-12-16Paper
F-Continuous Graphs2001-12-16Paper
https://portal.mardi4nfdi.de/entity/Q27069532001-10-03Paper
https://portal.mardi4nfdi.de/entity/Q49497752001-07-09Paper
https://portal.mardi4nfdi.de/entity/Q27213242001-07-02Paper
https://portal.mardi4nfdi.de/entity/Q27183412001-06-19Paper
https://portal.mardi4nfdi.de/entity/Q27136832001-06-10Paper
On the planarity of iterated jump graphs2001-05-21Paper
https://portal.mardi4nfdi.de/entity/Q49498682001-05-15Paper
Geodetic sets in graphs2001-03-30Paper
Resolvability in graphs and the metric dimension of a graph2001-02-27Paper
https://portal.mardi4nfdi.de/entity/Q49498512001-02-20Paper
https://portal.mardi4nfdi.de/entity/Q49339332001-02-13Paper
Resolvability and the upper dimension of graphs2001-01-15Paper
https://portal.mardi4nfdi.de/entity/Q44892102001-01-14Paper
https://portal.mardi4nfdi.de/entity/Q45048912001-01-14Paper
https://portal.mardi4nfdi.de/entity/Q44892422000-12-13Paper
The geodetic number of an oriented graph2000-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44885552000-07-09Paper
The partition dimension of a graph2000-06-29Paper
https://portal.mardi4nfdi.de/entity/Q49435112000-06-09Paper
https://portal.mardi4nfdi.de/entity/Q49400502000-03-01Paper
The forcing geodetic number of a graph1999-12-05Paper
https://portal.mardi4nfdi.de/entity/Q42673911999-10-04Paper
https://portal.mardi4nfdi.de/entity/Q48745851999-09-29Paper
https://portal.mardi4nfdi.de/entity/Q38382301999-01-11Paper
Rotation and jump distances between graphs1998-12-02Paper
https://portal.mardi4nfdi.de/entity/Q42117511998-10-07Paper
https://portal.mardi4nfdi.de/entity/Q42099551998-09-28Paper
Distance in digraphs1998-06-11Paper
https://portal.mardi4nfdi.de/entity/Q43932911998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43933651998-06-08Paper
Graph similarity and distance in graphs1998-05-29Paper
https://portal.mardi4nfdi.de/entity/Q43677761998-04-28Paper
https://portal.mardi4nfdi.de/entity/Q43860771998-04-26Paper
Subgraph distances in graphs defined by edge transfers1998-01-19Paper
https://portal.mardi4nfdi.de/entity/Q43430471997-10-07Paper
https://portal.mardi4nfdi.de/entity/Q43501661997-08-31Paper
https://portal.mardi4nfdi.de/entity/Q43462381997-08-03Paper
https://portal.mardi4nfdi.de/entity/Q43444531997-07-15Paper
https://portal.mardi4nfdi.de/entity/Q52840091997-05-19Paper
https://portal.mardi4nfdi.de/entity/Q27857101997-02-25Paper
https://portal.mardi4nfdi.de/entity/Q48879421996-07-23Paper
https://portal.mardi4nfdi.de/entity/Q48622111996-05-13Paper
https://portal.mardi4nfdi.de/entity/Q48634231996-04-22Paper
Convergent sequences of iterated \(H\)-line graphs1996-03-24Paper
https://portal.mardi4nfdi.de/entity/Q48634311996-02-06Paper
https://portal.mardi4nfdi.de/entity/Q48628901996-02-04Paper
https://portal.mardi4nfdi.de/entity/Q48578871996-01-24Paper
https://portal.mardi4nfdi.de/entity/Q48537411995-11-01Paper
https://portal.mardi4nfdi.de/entity/Q46976161995-10-05Paper
https://portal.mardi4nfdi.de/entity/Q46975081995-05-01Paper
https://portal.mardi4nfdi.de/entity/Q43055361994-10-12Paper
https://portal.mardi4nfdi.de/entity/Q31392761994-05-30Paper
https://portal.mardi4nfdi.de/entity/Q42945721994-05-17Paper
https://portal.mardi4nfdi.de/entity/Q42880791994-04-21Paper
https://portal.mardi4nfdi.de/entity/Q31397551993-11-11Paper
Directed distance in digraphs: Centers and medians1993-10-13Paper
Principal common divisors of graphs1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40299721993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40299821993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40213991993-01-16Paper
The ubiquitous Petersen graph1993-01-16Paper
Edge-clique graphs1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39766051992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39766211992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39766391992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39766471992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39721291992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39725101992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q34721271990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34800761990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32030491990-01-01Paper
A Matter of Degree1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34900401989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42067591989-01-01Paper
Greatest common subgroups with specified properties1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34768261988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38221951988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38244551988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38280251988-01-01Paper
Variations on a theorem of Petersen1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37623571987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37817921987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37841081987-01-01Paper
On maximum matchings in cubic graphs with a bounded number of bridge-covering paths1987-01-01Paper
Highly irregular graphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37357321986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38015921986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38047311986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38183151986-01-01Paper
Connected graphs containing a given connected graph as a unique greatest common subgraph1986-01-01Paper
Bipartite regulation numbers1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36825191985-01-01Paper
The partial complement of graphs1985-01-01Paper
Randomly n-cyclic digraphs1985-01-01Paper
On the regulation number of a multigraph1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32167021985-01-01Paper
Bridge and cycle degrees of vertices of graphs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33358241984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36970391983-01-01Paper
Hamiltonian path graphs1983-01-01Paper
On randomly 3-axial graphs1982-01-01Paper
Smallest cubic and quartic graphs with a given number of cutpoints and bridges1982-01-01Paper
Randomly k-axial graphs1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39181411981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39242481981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39330111981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39330141981-01-01Paper
Graphs with prescribed degree sets and girth1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38792801980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39015511980-01-01Paper
On ramsey numbers of forests versus nearly complete graphs1980-01-01Paper
On ramsey numbers of forests versus nearly complete graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38614351979-01-01Paper
A sufficient condition for graphs with 1-factors1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39374381979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41878401979-01-01Paper
A note on locally connected and Hamiltonian-connected graphs1979-01-01Paper
A note on 1-factors in graphs1979-01-01Paper
Mixed ramsey numbers: Chromatic numbers versus graphs1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41632441977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40934801976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40712751975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40934741975-01-01Paper
On regular bipartite-preserving supergraphs1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40460701974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41178501974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44049311974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44051911974-01-01Paper
Which Graphs Have Unique Distance Trees?1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773181974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51835221974-01-01Paper
The square of a block is Hamiltonian connected1974-01-01Paper
Ramsey theory and chromatic numbers1974-01-01Paper
On Hamiltonian properties of powers of special Hamiltonian graphs1974-01-01Paper
A technique for reconstructing disconnected graphs1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56706551973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56775281973-01-01Paper
A note on cycle Ramsey numbers1973-01-01Paper
Critically n-Connected Graphs1972-01-01Paper
Critically n-Connected Graphs1972-01-01Paper
On a Variation of the Ramsey Number1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56131211971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56131331971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56252121971-01-01Paper
On the existence of specified cycles in complementary graphs1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56483811971-01-01Paper
Graphs with forbidden subgraphs1971-01-01Paper
On minimal regular digraphs with given girth1970-01-01Paper
n-Hamiltonian graphs1970-01-01Paper
ON RECONSTRUCTING DISCONNECTED GRAPHS1970-01-01Paper
Randomly traversable graphs1970-01-01Paper
The cube of every connected graph is 1-hamiltonian1969-01-01Paper
On uniquely colorable planar graphs1969-01-01Paper
The Point-Arboricity of Planar Graphs1969-01-01Paper
Randomly hamiltonian digraphs1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55981891969-01-01Paper
The connectivity of line-graphs1969-01-01Paper
On a special class of hamiltonian graphs1969-01-01Paper
Line-coloring of signed graphs1969-01-01Paper
A generalization of hamiltonian-connected graphs1969-01-01Paper
Randomly Traceable Graphs1968-01-01Paper
On Hamiltonian Line-Graphs1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55609161968-01-01Paper
A sufficient condition for n ‐connectedness of graphs1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55641351968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55663141968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55801681968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55989271968-01-01Paper
The point-arboricity of a graph1968-01-01Paper
Starlike Graphs1967-01-01Paper
The Colour Numbers of Complete Graphs1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55458411967-01-01Paper
The Lattice-Graph of the Topology of a Transitive Directed Graph.1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55641341967-01-01Paper
No Graph is Perfect1967-01-01Paper
Total Digraphs1966-01-01Paper
A Graph-Theoretic Approach to a Communications Problem1966-01-01Paper
Total Graphs and Traversability1966-01-01Paper
The existence of complete cycles in repeated line-graphs1965-01-01Paper
A Characterization of Certain Ptolemaic Graphs1965-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Gary Chartrand