|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 22 occurrences of 21 keywords
|
|
|
|
|
Results
Found 126 publication records. Showing 126 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 88 | Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia |
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs.  |
SIROCCO  |
2007 |
DBLP DOI BibTeX RDF |
Edge Colouring, Wedge, Wireless Network, Location Awareness, Local Algorithm, Unit Disk Graphs, Geometric Graphs |
| 80 | Rahul Muthu, N. Narayanan 0001, C. R. Subramanian 0001 |
Acyclic Edge Colouring of Outerplanar Graphs. |
AAIM |
2007 |
DBLP DOI BibTeX RDF |
|
| 79 | Rahul Muthu, N. Narayanan 0001, C. R. Subramanian 0001 |
Optimal Acyclic Edge Colouring of Grid Like Graphs. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
Acyclic Edge Colouring, Acyclic Chromatic Index, Graph, Hypercube, Mesh, Tori |
| 66 | O. A. Ogunyode |
Parallel Algorithms for Approximate Edge Colouring of Simple graphs. |
FSTTCS |
1987 |
DBLP DOI BibTeX RDF |
edge-colouring, algorithm: approximation, parallel, graphs, probabilistic, SIMD computer |
| 66 | Omid Amini, Louis Esperet, Jan van den Heuvel |
A unified approach to distance-two colouring of planar graphs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 53 | Artur Czumaj, Alan Gibbons |
Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs. |
ICALP |
1993 |
DBLP DOI BibTeX RDF |
|
| 51 | Alexander Schrijver |
Matching, Edge-Colouring, and Dimers. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
| 43 | Stefan Porschen, Ewald Speckenmeyer, Bert Randerath |
On Linear CNF Formulas. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
linear CNF formula, edge colouring, linear hypergraph, NP-completeness, satisfiability, latin square |
| 36 | David J. Abraham, Jeffrey H. Kingston |
Generalizing Bipartite Edge Colouring to Solve Real Instances of the Timetabling Problem. |
PATAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 35 | Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon |
Edge-colouring and total-colouring chordless graphs. |
CoRR |
2013 |
DBLP BibTeX RDF |
|
| 35 | Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon |
Edge-colouring and total-colouring chordless graphs. |
Discret. Math. |
2013 |
DBLP DOI BibTeX RDF |
|
| 35 | Raphael Machado, Celina M. H. de Figueiredo |
Complexity separating classes for edge-colouring and total-colouring. |
J. Braz. Comput. Soc. |
2011 |
DBLP DOI BibTeX RDF |
|
| 32 | Keith Edwards, Mirko Hornák, Mariusz Wozniak |
On the Neighbour-Distinguishing Index of a Graph. |
Graphs Comb. |
2006 |
DBLP DOI BibTeX RDF |
|
| 32 | Aleksandar Trifunovic, William J. Knottenbelt |
A General Graph Model for Representing Exact Communication Volume in Parallel Sparse Matrix-Vector Multiplication. |
ISCIS |
2006 |
DBLP DOI BibTeX RDF |
|
| 27 | Mirko Hornák, Stefan Pcola, Mariusz Wozniak |
On the Achromatic Index of for a Prime q. |
Graphs Comb. |
2004 |
DBLP DOI BibTeX RDF |
Proper complete edge colouring, Achromatic index, Complete graph |
| 27 | Alessandro Panconesi, Romeo Rizzi |
Some simple distributed algorithms for sparse networks. |
Distributed Comput. |
2001 |
DBLP DOI BibTeX RDF |
Vertex colouring, Edge colouring, Distributed computing, Maximal independent set, Sparse networks, Maximal matching |
| 20 | Marthe Bonamy, Michelle Delcourt, Richard Lang, Luke Postle |
Edge-colouring graphs with local list sizes. |
J. Comb. Theory, Ser. B |
2024 |
DBLP DOI BibTeX RDF |
|
| 20 | Aleksander B. G. Christiansen |
Deterministic Dynamic Edge-Colouring. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
| 20 | Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni |
On Vizing's edge colouring question. |
J. Comb. Theory, Ser. B |
2023 |
DBLP DOI BibTeX RDF |
|
| 20 | Aleksander B. G. Christiansen, Eva Rotenberg, Juliette Vlieghe |
Sparsity-Parameterised Dynamic Edge Colouring. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 20 | Zdenek Dvorák 0001, Abhiruk Lahiri |
Maximum edge colouring problem on graphs that exclude a fixed minor. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 20 | Zdenek Dvorák 0001, Abhiruk Lahiri |
Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor. |
WG |
2023 |
DBLP DOI BibTeX RDF |
|
| 20 | Pierre Aboulker, Guillaume Aubian, Chien-Chung Huang |
Vizing's and Shannon's Theorems for Defective Edge Colouring. |
Electron. J. Comb. |
2022 |
DBLP DOI BibTeX RDF |
|
| 20 | Antoine Dailly, Éric Duchêne, Aline Parreau, Elzbieta Sidorowicz |
The neighbour sum distinguishing relaxed edge colouring. |
Appl. Math. Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
| 20 | Pierre Aboulker, Guillaume Aubian, Chien-Chung Huang |
Vizing's and Shannon's Theorems for defective edge colouring. |
CoRR |
2022 |
DBLP BibTeX RDF |
|
| 20 | L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh |
Improved approximation for maximum edge colouring problem. |
Discret. Appl. Math. |
2022 |
DBLP DOI BibTeX RDF |
|
| 20 | Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni |
On Vizing's edge colouring question. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 20 | Marthe Bonamy, Carla Groenland, Carole Muller, Jonathan Narboni, Jakub Pekárek, Alexandra Wesolek |
A note on connected greedy edge colouring. |
Discret. Appl. Math. |
2021 |
DBLP DOI BibTeX RDF |
|
| 20 | Moses Charikar, Paul Liu 0001 |
Improved Algorithms for Edge Colouring in the W-Streaming Model. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
| 20 | Julien Bensmail, François Dross, Hervé Hocquard, Éric Sopena |
From light edges to strong edge-colouring of 1-planar graphs. |
Discret. Math. Theor. Comput. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
| 20 | Akshay Singh, Sanjeev Saxena |
Edge colouring Game on Trees with maximum degree Δ=4. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 20 | Moses Charikar, Paul Liu 0001 |
Improved Algorithms for Edge Colouring in the W-Streaming Model. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 20 | Leandro M. Zatesko, Alesom Zorzi, Renato Carmo, André Luiz Pires Guedes |
Edge-colouring graphs with bounded local degree sums. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 20 | Rupkumar Mahapatra, Sovan Samanta, Madhumangal Pal |
Applications of Edge Colouring of Fuzzy Graphs. |
Informatica |
2020 |
DBLP DOI BibTeX RDF |
|
| 20 | Subhasis Thakur, John G. Breslin |
An Edge Colouring-based Collaborative Routing Protocol for Blockchain Offline Channels. |
Blockchain |
2020 |
DBLP DOI BibTeX RDF |
|
| 20 | Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries |
Classifying k-edge colouring for H-free graphs. |
Inf. Process. Lett. |
2019 |
DBLP DOI BibTeX RDF |
|
| 20 | Joshua Harrelson, Jessica McDonald, Gregory J. Puleo |
List-edge-colouring planar graphs with precoloured edges. |
Eur. J. Comb. |
2019 |
DBLP DOI BibTeX RDF |
|
| 20 | Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo |
Connecting edge-colouring. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 20 | L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh |
Improved Approximation for Maximum Edge Colouring Problem. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 20 | Corwin Sinnamon |
A Randomized Algorithm for Edge-Colouring Graphs in O(m√n) Time. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 20 | Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries |
On the Parameterized Complexity of k-Edge Colouring. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 20 | Nicolas Grelier, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot |
Approximate Strong Edge-Colouring of Unit Disk Graphs. |
WAOA |
2019 |
DBLP DOI BibTeX RDF |
|
| 20 | Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries |
Classifying k-Edge Colouring for H-free Graphs. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 20 | Gwenaël Joret, William Lochet |
Progress on the adjacent vertex distinguishing edge colouring conjecture. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 20 | Krzysztof Piejko, Lucyna Trojnar-Spelina |
On (A, 2B, 2C)-edge colouring in certain class of graphs. |
Ars Comb. |
2018 |
DBLP BibTeX RDF |
|
| 20 | Olivier Baudon, Jakub Przybylo, Mohammed Senhaji, Elzbieta Sidorowicz, Éric Sopena, Mariusz Wozniak |
The neighbour-sum-distinguishing edge-colouring game. |
Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
| 20 | Guus Regts, Alexander Schrijver |
Compact orbit spaces in Hilbert spaces and limits of edge-colouring models. |
Eur. J. Comb. |
2016 |
DBLP DOI BibTeX RDF |
|
| 20 | Richard Lang |
A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3. |
Graphs Comb. |
2016 |
DBLP DOI BibTeX RDF |
|
| 20 | Lucyna Trojnar-Spelina, Iwona Wloch |
On Pell numbers and (k1, A1, k2, A2, k3, A3)-edge colouring in graphs. |
Ars Comb. |
2016 |
DBLP BibTeX RDF |
|
| 20 | John Asplund, Jessica McDonald |
On a limit of the method of Tashkinov trees for edge-colouring. |
Discret. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
| 20 | Katherine Edwards, Daniel P. Sanders, Paul D. Seymour, Robin Thomas 0001 |
Three-edge-colouring doublecross cubic graphs. |
J. Comb. Theory, Ser. B |
2016 |
DBLP DOI BibTeX RDF |
|
| 20 | Frédéric Havet, Ana Karolinna Maia, Min-Li Yu |
Complexity of greedy edge-colouring. |
J. Braz. Comput. Soc. |
2015 |
DBLP DOI BibTeX RDF |
|
| 20 | Igor Fabrici, Stanislav Jendrol', Michaela Vrbjarová |
Unique-maximum edge-colouring of plane graphs with respect to faces. |
Discret. Appl. Math. |
2015 |
DBLP DOI BibTeX RDF |
|
| 20 | Maria Chudnovsky, Katherine Edwards, Paul D. Seymour |
Edge-colouring eight-regular planar graphs. |
J. Comb. Theory, Ser. B |
2015 |
DBLP DOI BibTeX RDF |
|
| 20 | Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour |
Edge-colouring seven-regular planar graphs. |
J. Comb. Theory, Ser. B |
2015 |
DBLP DOI BibTeX RDF |
|
| 20 | Romeo Rizzi, David Cariolaro |
Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes. |
Algorithmica |
2014 |
DBLP DOI BibTeX RDF |
|
| 20 | Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov |
Strong edge-colouring of sparse planar graphs. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
| 20 | Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov |
Strong edge-colouring of sparse planar graphs. |
Discret. Appl. Math. |
2014 |
DBLP DOI BibTeX RDF |
|
| 20 | Robert Lukot'ka |
Acyclic 4-edge colouring of non-regular subcubic graphs in linear time. |
Discret. Appl. Math. |
2014 |
DBLP DOI BibTeX RDF |
|
| 20 | Rakesh P. Badoni, Dharmendra Kumar Gupta |
A graph edge colouring approach for school timetabling problems. |
Int. J. Math. Oper. Res. |
2014 |
DBLP DOI BibTeX RDF |
|
| 20 | Tony T. Lee, Yujie Wan, Hao Guan |
Randomized Δ-edge colouring via exchanges of complex colours. |
Int. J. Comput. Math. |
2013 |
DBLP DOI BibTeX RDF |
|
| 20 | Hervé Hocquard, Pascal Ochem, Petru Valicov |
Strong edge-colouring and induced matchings. |
Inf. Process. Lett. |
2013 |
DBLP DOI BibTeX RDF |
|
| 20 | Denis Cornaz, V. H. Nguyen |
Kőnig's edge-colouring theorem for all graphs. |
Oper. Res. Lett. |
2013 |
DBLP DOI BibTeX RDF |
|
| 20 | Jean-Luc Fouquet, Jean-Marie Vanherpe |
On Parsimonious Edge-Colouring of Graphs with Maximum Degree Three. |
Graphs Comb. |
2013 |
DBLP DOI BibTeX RDF |
|
| 20 | Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov |
On strong edge-colouring of subcubic graphs. |
Discret. Appl. Math. |
2013 |
DBLP DOI BibTeX RDF |
|
| 20 | Caterina De Simone, Anna Galluccio |
Edge-colouring of joins of regular graphs II. |
J. Comb. Optim. |
2013 |
DBLP DOI BibTeX RDF |
|
| 20 | Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour |
Edge-colouring seven-regular planar graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 20 | Maria Chudnovsky, Katherine Edwards, Paul D. Seymour |
Edge-colouring eight-regular planar graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 20 | Jean-Luc Fouquet, Jean-Marie Vanherpe |
Tools for parsimonious edge-colouring of graphs with maximum degree three |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 20 | Anna Fiedorowicz |
Acyclic edge colouring of plane graphs. |
Discret. Appl. Math. |
2012 |
DBLP DOI BibTeX RDF |
|
| 20 | Július Czap, Stanislav Jendrol', Frantisek Kardos, Roman Soták |
Facial parity edge colouring of plane pseudographs. |
Discret. Math. |
2012 |
DBLP DOI BibTeX RDF |
|
| 20 | Penny Haxell, Jessica McDonald |
On characterizing Vizing's edge colouring bound. |
J. Graph Theory |
2012 |
DBLP DOI BibTeX RDF |
|
| 20 | Hervé Hocquard, Pascal Ochem, Petru Valicov |
Bounds and complexity results for strong edge colouring of subcubic graphs. |
Electron. Notes Discret. Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 20 | Jean-Luc Fouquet, Jean-Marie Vanherpe |
A new bound for parsimonious edge-colouring of graphs with maximum degree three |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 20 | Hervé Hocquard, Petru Valicov |
Strong edge colouring of subcubic graphs. |
Discret. Appl. Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 20 | Július Czap, Stanislav Jendrol', Frantisek Kardos |
Facial parity edge colouring. |
Ars Math. Contemp. |
2011 |
DBLP DOI BibTeX RDF |
|
| 20 | Edita Mácajová, Ján Mazák |
An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs. |
FAW-AAIM |
2011 |
DBLP DOI BibTeX RDF |
|
| 20 | David Pritchard, Thomas Rothvoß |
Edge-Colouring Hypergraphs Properly (Covering with Matchings) or Polychromatically (Packing Covers) |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 20 | Mieczyslaw Borowiecki, Anna Fiedorowicz |
Acyclic edge colouring of planar graphs without short cycles. |
Discret. Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 20 | Stephan Brandt, Kristína Budajová, Dieter Rautenbach, Michael Stiebitz |
Edge colouring by total labellings. |
Discret. Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 20 | Rahul Muthu, N. Narayanan 0001, C. R. Subramanian 0001 |
Optimal acyclic edge colouring of grid like graphs. |
Discret. Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 20 | Diego Scheide |
Graph edge colouring: Tashkinov trees and Goldberg's conjecture. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 20 | Nathann Cohen, Frédéric Havet, Tobias Müller |
Acyclic edge-colouring of planar graphs. Extended abstract. |
Electron. Notes Discret. Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 20 | W. Sean Kennedy, Conor Meagher, Bruce A. Reed |
Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time. |
Electron. Notes Discret. Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 20 | Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia |
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 20 | David Cariolaro |
A theorem in edge colouring. |
Discret. Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 20 | Caterina De Simone, Anna Galluccio |
Edge-colouring of joins of regular graphs, I. |
J. Comb. Optim. |
2009 |
DBLP DOI BibTeX RDF |
|
| 20 | Jean-Luc Fouquet, Jean-Marie Vanherpe |
On parcimonious edge-colouring of graphs with maximum degree three |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 20 | Noga Alon, Vera Asodi |
Edge Colouring with Delays. |
Comb. Probab. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 20 | Caterina De Simone, Anna Galluccio |
Edge-colouring of regular graphs of large degree. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 20 | Mario Gionfriddo, Alberto Amato |
An edge colouring of multigraphs. |
Comput. Sci. J. Moldova |
2007 |
DBLP BibTeX RDF |
|
| 20 | V. Vijayalakshmi |
On Multiplicity of triangles in 2-edge colouring of graphs. |
Ars Comb. |
2007 |
DBLP BibTeX RDF |
|
| 20 | Rahul Muthu, N. Narayanan 0001, C. R. Subramanian 0001 |
Improved bounds on acyclic edge colouring. |
Discret. Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 20 | C. R. Subramanian 0001 |
Analysis of a heuristic for acyclic edge colouring. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 20 | Caterina De Simone, Célia Picinin de Mello |
Edge-colouring of join graphs. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 20 | Rahul Muthu, N. Narayanan 0001, C. R. Subramanian 0001 |
Improved bounds on acyclic edge colouring. |
Electron. Notes Discret. Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 20 | Alan Gibbons, Paul Sant |
Rotation sequences and edge-colouring of binary tree pairs. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 20 | Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello, Carmen Ortiz |
Decompositions for the edge colouring of reduced indifference graphs. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 20 | G. Sajith, Sanjeev Saxena |
Fast parallel edge colouring of graphs. |
J. Parallel Distributed Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 20 | Paul Sant |
Algorithmics of edge-colouring pairs of 3-regular trees. |
|
2003 |
RDF |
|
Displaying result #1 - #100 of 126 (100 per page; Change: ) Pages: [ 1][ 2][ >>] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license