default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVaidy Sivaraman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j18]Jagdeep Singh, Vaidy Sivaraman:
Edge-apexing in hereditary classes of graphs. Discret. Math. 348(1): 114234 (2025)- 2024
- [j17]Mohammed A. Mutar
, Vaidy Sivaraman, Daniel C. Slilaty:
Signed Ramsey Numbers. Graphs Comb. 40(1): 9 (2024) - [i7]Jagdeep Singh, Vaidy Sivaraman:
Edge-apexing in hereditary classes of graphs. CoRR abs/2403.09456 (2024) - 2022
- [j16]T. Karthick, Jenny Kaufmann, Vaidy Sivaraman:
Coloring Graph Classes with no Induced Fork via Perfect Divisibility. Electron. J. Comb. 29(3) (2022) - [j15]Vaidy Sivaraman, Thomas Zaslavsky:
Two Hamiltonian cycles. Discret. Math. 345(5): 112797 (2022) - [j14]Vaidy Sivaraman, Daniel C. Slilaty:
The Family of Bicircular Matroids Closed Under Duality. Graphs Comb. 38(1): 24 (2022) - 2021
- [i6]T. Karthick, Jenny Kaufmann, Vaidy Sivaraman:
Coloring graph classes with no induced fork via perfect divisibility. CoRR abs/2104.02807 (2021) - 2020
- [j13]Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman:
Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded. J. Comb. Theory, Ser. B 140: 372-386 (2020) - [j12]Kathie Cameron, Shenwei Huang, Irena Penev, Vaidy Sivaraman:
The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness. J. Graph Theory 93(4): 503-552 (2020) - [i5]Vaidy Sivaraman:
Cop number of graphs without long holes. CoRR abs/2001.00477 (2020)
2010 – 2019
- 2019
- [j11]Bart Litjens, Sven C. Polak, Vaidy Sivaraman:
Sum-perfect graphs. Discret. Appl. Math. 259: 232-239 (2019) - [j10]Vaidy Sivaraman:
An application of the Gyárfás path argument. Discret. Math. 342(8): 2306-2307 (2019) - [j9]Vaidy Sivaraman, Daniel C. Slilaty:
The graphs that have antivoltages using groups of small order. Discret. Math. 342(11): 2951-2965 (2019) - [j8]Maria Chudnovsky, Vaidy Sivaraman:
Perfect divisibility and 2-divisibility. J. Graph Theory 90(1): 54-60 (2019) - [i4]Vaidy Sivaraman:
An application of the Gyárfás path argument. CoRR abs/1903.01338 (2019) - [i3]Vaidy Sivaraman, Stephen Testa:
Cop number of 2K2-free graphs. CoRR abs/1903.11484 (2019) - 2018
- [j7]Vaidy Sivaraman:
Some problems on induced subgraphs. Discret. Appl. Math. 236: 422-427 (2018) - [j6]Richard Behr, Vaidy Sivaraman, Thomas Zaslavsky:
Mock threshold graphs. Discret. Math. 341(8): 2159-2178 (2018) - [j5]Maria Chudnovsky, Vaidy Sivaraman:
Odd Holes in Bull-Free Graphs. SIAM J. Discret. Math. 32(2): 951-955 (2018) - [i2]Ringi Kim, O-joung Kwon, Sang-il Oum, Vaidy Sivaraman:
Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded. CoRR abs/1809.04278 (2018) - 2017
- [j4]John Maharry, Neil Robertson, Vaidy Sivaraman, Daniel C. Slilaty:
Flexibility of projective-planar embeddings. J. Comb. Theory B 122: 241-300 (2017) - [i1]Maria Chudnovsky, Vaidy Sivaraman:
Odd holes in bull-free graphs. CoRR abs/1704.04262 (2017) - 2015
- [j3]Vaidy Sivaraman:
A unified proof of Brooks' theorem and Catlin's theorem. Discret. Math. 338(2): 272-273 (2015) - 2014
- [j2]Vaidy Sivaraman:
Bicircular signed-graphic matroids. Discret. Math. 328: 1-4 (2014) - 2013
- [j1]Vaidy Sivaraman:
Two short proofs of the bounded case of S.B. Rao's degree sequence conjecture. Discret. Math. 313(13): 1500-1501 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
