Path factors in subgraphs (Englisch)
- Neue Suche nach: Zhou, Sizhong
- Neue Suche nach: Bian, Qiuxiang
- Neue Suche nach: Pan, Quanru
- Neue Suche nach: Zhou, Sizhong
- Neue Suche nach: Bian, Qiuxiang
- Neue Suche nach: Pan, Quanru
In:
Discrete Applied Mathematics
;
319
;
183-191
;
2021
-
ISSN:
- Aufsatz (Zeitschrift) / Elektronische Ressource
-
Titel:Path factors in subgraphs
-
Beteiligte:
-
Erschienen in:Discrete Applied Mathematics ; 319 ; 183-191
-
Verlag:
- Neue Suche nach: Elsevier B.V.
-
Erscheinungsdatum:15.04.2021
-
Format / Umfang:9 pages
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Zeitschrift)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis – Band 319
Zeige alle Jahrgänge und Ausgaben
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Preface: CALDAM 2019Swami, Sarvottamananda / Pal, Sudebkumar Prasant et al. | 2022
- 2
-
Improved descriptional complexity results on generalized forbidding grammarsFernau, Henning / Kuppusamy, Lakshmanan / Oladele, Rufus O. / Raman, Indhumathi et al. | 2020
- 19
-
The Dudeney–Stockmeyer ConjectureHinz, Andreas M. / Lužar, Borut / Petr, Ciril et al. | 2021
- 27
-
Bumblebee visitation problemDas, Sandip / Gahlawat, Harmender et al. | 2022
- 42
-
Improved approximation for maximum edge colouring problemChandran, L. Sunil / Lahiri, Abhiruk / Singh, Nitin et al. | 2021
- 53
-
On chordal and perfect plane near-triangulationsSalam, Sameera M. / Warrier, Nandini J. / Chacko, Daphna / Murali Krishnan, K. / K.S., Sudeep et al. | 2020
- 61
-
A linear time algorithm for the nullity of vertex-weighted block graphsSingh, Ranveer / Shaked-Monderer, Naomi / Berman, Avi et al. | 2020
- 71
-
Collision-free routing problem with restricted L-pathAjay, Jammigumpula / Jana, Satyabrata / Roy, Sasanka et al. | 2021
- 81
-
Induced star partition of graphsShalu, M.A. / Vijayakumar, S. / Sandhya, T.P. / Mondal, Joyashree et al. | 2021
- 92
-
Covering and packing of triangles intersecting a straight linePandit, Supantha et al. | 2021
- 111
-
The balanced connected subgraph problemBhore, Sujoy / Chakraborty, Sourav / Jana, Satyabrata / Mitchell, Joseph S.B. / Pandit, Supantha / Roy, Sasanka et al. | 2020
- 121
-
Storing four elements in the two query bitprobe modelBaig, Mirza Galib Anwarul Husain / Kesh, Deepanjan / Sodani, Chirag et al. | 2021
- 132
-
On the bitprobe complexity of two probe adaptive schemesKesh, Deepanjan / Sharma, Vidya Sagar et al. | 2021
- 141
-
On selecting a fraction of leaves with disjoint neighborhoods in a plane treeJunginger, Kolja / Mantas, Ioannis / Papadopoulou, Evanthia et al. | 2021
- 149
-
Properties of m-bonacci-sum graphsMahalingam, Kalpana / Rajendran, Helda Princy et al. | 2021
- 159
-
The median of Sierpiński graphsBalakrishnan, Kannan / Changat, Manoj / Hinz, Andreas M. / Lekha, Divya Sindhu et al. | 2021
- 171
-
On graphs whose eternal vertex cover number and vertex cover number coincideBabu, Jasine / Chandran, L. Sunil / Francis, Mathew / Prabhakaran, Veena / Rajendraprasad, Deepak / Warrier, Nandini J. et al. | 2021
- 183
-
Path factors in subgraphsZhou, Sizhong / Bian, Qiuxiang / Pan, Quanru et al. | 2021
- 192
-
Preface: CALDAM 2020Changat, Manoj / Das, Sandip et al. | 2022
- 194
-
New algorithms and bounds for halving pseudolinesBereg, Sergey / Haghpanah, Mohammadreza et al. | 2021
- 207
-
Algorithms for Radon partitions with toleranceBereg, Sergey / Haghpanah, Mohammadreza et al. | 2021
- 216
-
Planar projections of graphsAravind, N.R. / Maniyar, Udit et al. | 2021
- 223
-
Hardness results of global total -domination problem in graphsPanda, B.S. / Goyal, Pooja et al. | 2021
- 239
-
Structural parameterization for minimum conflict-free colouringAshok, Pradeesha / Bhargava, Rathin / Gupta, Naman / Khalid, Mohammad / Yadav, Dolly et al. | 2021
- 254
-
Vertex partitioning problems on graphs with bounded tree widthAravind, N.R. / Kalyanasundaram, Subrahmanyam / Kare, Anjeneya Swami et al. | 2021
- 271
-
Perfect Italian domination in graphs: Complexity and algorithmsPradhan, D. / Banerjee, S. / Liu, Jia-Bao et al. | 2021
- 296
-
A new model and algorithms in firefighting theoryKlein, Rolf / Kübel, David / Langetepe, Elmar / Sack, Jörg-Rüdiger / Schwarzwald, Barbara et al. | 2021
- 310
-
Maximum 0-1 timed matching on temporal graphsMandal, Subhrangsu / Gupta, Arobinda et al. | 2021
- 327
-
The complexity of restricted star colouringM.A., Shalu / Antony, Cyriac et al. | 2021
- 351
-
Vertex-edge domination in unit disk graphsJena, Sangram K. / Das, Gautam K. et al. | 2021
- 362
-
Oriented diameter of star graphsKumar, K.S. Ajish / Rajendraprasad, Deepak / Sudeep, K.S. et al. | 2021
- 372
-
A primal–dual approximation algorithm for MinsatArif, Umair / Benkoczi, Robert / Gaur, Daya Ram / Krishnamurti, Ramesh et al. | 2021
- 382
-
Approximation algorithms for some Minimum Postmen Cover ProblemsMao, Yuying / Yu, Wei / Liu, Zhaohui / Xiong, Jiafeng et al. | 2022
- 394
-
Overlaying a hypergraph with a graph with bounded maximum degreeHavet, Frédéric / Mazauric, Dorian / Nguyen, Viet-Ha / Watrigant, Rémi et al. | 2022
- 407
-
On vertices contained in all or in no metric basisHakanen, Anni / Junnila, Ville / Laihonen, Tero / Yero, Ismael G. et al. | 2021
- 424
-
Monitoring the edges of a graph using distancesFoucaud, Florent / Kao, Shih-Shun / Klasing, Ralf / Miller, Mirka / Ryan, Joe et al. | 2021
- 439
-
Metric properties of Sierpiński triangle graphsHinz, Andreas M. / Holz auf der Heide, Caroline / Zemljič, Sara Sabrina et al. | 2021
- 454
-
A note on the metric and edge metric dimensions of 2-connected graphsKnor, Martin / Škrekovski, Riste / Yero, Ismael G. et al. | 2021
- 461
-
The Wiener index of the zero-divisor graph ofAsir, T. / Rabikka, V. et al. | 2021
- 472
-
New results on radio -labelings of distance graphsKorže, Danilo / Shao, Zehui / Vesel, Aleksander et al. | 2021
- 480
-
A note on the convexity number of the complementary prisms of treesP.K., Neethu / Chandran S.V., Ullas et al. | 2021
- 487
-
On the -interval and the -convexity numbers of graphs and graph productsAnand, Bijo S. / Dourado, Mitre C. / Narasimha-Shenoi, Prasanth G. / Ramla, Sabeer S. et al. | 2021
- 499
-
Computational and structural aspects of the geodetic and the hull numbers of shadow graphsS.V., Ullas Chandran / Dourado, Mitre C. / Thankachy, Maya G.S. et al. | 2021
- 511
-
A note on fractional ID--factor-critical covered graphsZhou, Sizhong / Liu, Hongxia / Xu, Yang et al. | 2021
- 517
-
Generalized bijective maps between -parking functions, spanning trees, and the Tutte polynomialFrizzell, Carrie et al. | 2021
- 533
-
On Cartesian products of signed graphsLajou, Dimitri et al. | 2021
- 556
-
Are all pairs of hypomorphic digraphs S-isomorphic?Ramachandran, S. et al. | 2021
- 564
-
Smallest -critical graphs of odd-girthBeaudou, Laurent / Foucaud, Florent / Naserasr, Reza et al. | 2021
- 576
-
On indicated coloring of lexicographic product of graphsFrancis, P. / Francis Raj, S. / Gokulnath, M. et al. | 2021
- 583
-
On lengths of edge-labeled graph expressionsKorenblit, Mark / Levit, Vadim E. et al. | 2022
- 595
-
Representation learning for temporal networks using temporal random walk and deep autoencoderMohan, Anuraj / Pramod, K.V. et al. | 2022
- ii
-
Editorial Board| 2022